Renormalization, Uniformization and Circle Packings
Speaker(s): Yusheng Luo(Cornell University)
Time: 10:00-10:50 May 16, 2024
Venue: Online
Circle packings have many applications in geometry, analysis and dynamics. The combinatorics of a circle packing is captured by the contact graph, called the nerve of the circle packing. It is natural and important to understand：
1. Given a graph G, when is it isomorphic to the nerve of a circle packing?
2. Is the circle packing rigid? Or more generally, what is the moduli space of circle packings with nerve isomorphic to G?
3. How are different circle packings with isomorphic nerves related? For finite graphs, Kobe-Andreev-Thurston’s circle packing theorem give a complete answer to the above questions. The situation is more complicated for infinite graphs, and has been extensively studied for locally finite triangulations.
Zoom ID: 181 155 584
