arXiv · 2502.17627
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.
Explore related subjects
Keep this discovery
Jayadev Athreya, Pascal Hubert, Serge Troubetzkoy. 2025-02-24. Complexity for billiards in regular N-gons. https://arxiv.org/abs/2502.17627
Cite the original work for its findings. Save a collection to share your selection of sources.