Complexity for billiards in regular N-gons

Abstract:

We compute the complexity of the billiard language of the regular Euclidean N-gons (and other families of rational lattice polygons), answering a question posed by Cassaigne-Hubert-Troubetzkoy. Our key technical result is a counting result for saddle connections on lattice surfaces, when we count by combinatorial length. No prior knowledge of geometry of surfaces will be assumed. This is joint work with Pascal Hubert and Serge Troubetzkoy.

Note: There is no pre-seminar. The main talk starts at 4:10.

Join Zoom Meeting: https://washington.zoom.us/j/91547335974
Meeting ID: 915 4733 5974