Counting Colored Triangulations
Dr Luca Lionni
Date & Time
15 Jan 2019 (Tue) | 03:00 PM - 04:00 PM
Venue
2208, Li Dak Sum Yip Yio Chin Academic Building (AC2), CityU
Abstract
(D+1)-Edge-colored graphs represent D-dimensional triangulations, and the geometrical and topological properties of the latter are translated into graph properties. A canonical discrete curvature is defined for these triangulations. Motivated by theoretical physics, we focus on the problem which consists in studying the combinatorics and the large scale properties of triangulations of maximal curvature.