arXiv (All)
open access
Complexity for billiards in regular N-gons
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Counting Lattice Points in Minkowski Sums of Cross Polytopes#677742
- Counting Lattice Points in Minkowski Sums of Cross Polytopes#674532
- Planes in quadratic 4-space and associated shapes of lattices#618092
- Planes in quadratic 4-space and associated shapes of lattices#617592
- Statistical Correlators and Tripartite Entanglement#1063699
Record · ID 1051983
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive