Complexity for billiards in regular N-gons
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908417981939712 |
|---|---|
| author | Athreya, Jayadev Hubert, Pascal Troubetzkoy, Serge |
| author_facet | Athreya, Jayadev Hubert, Pascal Troubetzkoy, Serge |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_17627 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Complexity for billiards in regular N-gons Athreya, Jayadev Hubert, Pascal Troubetzkoy, Serge Dynamical Systems Complex Variables Geometric Topology 37C83, 32G15, 30F30, 37E15 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. |
| title | Complexity for billiards in regular N-gons |
| topic | Dynamical Systems Complex Variables Geometric Topology 37C83, 32G15, 30F30, 37E15 |
| url | https://arxiv.org/abs/2502.17627 |