Combinatorial periods of asymmetric billiard trajectories in the regular pentagon

Primarily AI-generated textHuman understanding: some partsmath.DS — Dynamical Systemsmath.MG — Metric Geometry

Contributed by Peter Graham ↗

Version 1 / Nov 21, 2026 / CC BY 4.0

Abstract

We prove that every even integer other than 22, 1212, 1414 and 1818 is the combinatorial period, the number of bounces before repeating, of a periodic billiard trajectory in the regular pentagon that does not have five-fold rotational symmetry. Davis and Lelièvre conjectured this in 2018 and checked it up to period 40004000, and Kontorovich and Zhang proved it for almost every even number. As they explain, a theorem of Davis, Fuchs and Tabachnikov turns the question into one about vectors. Each vector (a+bφ,c+dφ)(a+b\varphi,c+d\varphi) obtained from (0,1)(0,1) by products of four explicit 2×22\times2 matrices, where φ\varphi is the golden ratio and a,b,c,da,b,c,d are integers, has the half-period ℓ=a+b+c+d\ell=a+b+c+d, and when a congruence modulo 55 holds it gives such a trajectory of period n=2ℓn=2\ell. Varying the power of one of the two triangular matrices in such a product gives half-periods in an arithmetic progression. We give 379379 of these progressions, which together contain every half-period ℓ≥2\ell\ge2 except nine values. Six of the nine come from explicit trajectories checked in exact arithmetic; the other three are halves of excluded periods. The covering argument is checked in Lean, assuming the cited theorem. Whether the four excluded periods occur is not treated. This work has not yet been reviewed by experts. The proofs, the Lean formalization and the text were produced by AI models, working under the author's direction.

Author comments: Zenodo archive: https://doi.org/10.5281/zenodo.24119275. Paper text license: CC BY 4.0. The published code and data are governed by the licenses in the tagged release. Release archive folders: lean, checks, data.

Provenance statement

The proofs, the Lean formalization and the text were produced by AI models, working under the author's direction. Human understanding (author): I follow the statements, not every proof step.

References

  1. D. Davis, D. Fuchs and S. Tabachnikov, Periodic trajectories in the regular pentagon , Mosc. Math. J. 11 (2011), no. 3, 439--461; arXiv:1102.1005 (https://arxiv.org/abs/1102.1005).arXiv
  2. D. Davis and S. Lelièvre, Periodic paths on the pentagon, double pentagon and golden L , arXiv:1810.11310v2 (https://arxiv.org/abs/1810.11310v2) (2024).arXiv
  3. A. Kontorovich and X. Zhang, On the local-global conjecture for combinatorial period lengths of closed billiards on the regular pentagon , Int. Math. Res. Not. IMRN 2025 (2025), no. 15, rnaf227, doi:10.1093/imrn/rnaf227 (https://doi.org/10.1093/imrn/rnaf227); arXiv:2409.10682 (https://arxiv.org/abs/2409.10682).arXivDOI
  4. L. de Moura and S. Ullrich, The Lean 4 theorem prover and programming language , in: Automated Deduction -- CADE 28, Lecture Notes in Comput. Sci. 12699 , Springer, 2021, 625--635.

Version history

  1. v1 · 7 pagesSubmitted by P. GrahamZenodo archive: https://doi.org/10.5281/zenodo.24119275. Paper text license: CC BY 4.0. The published code and data are governed by the licenses in the tagged release. Release archive folders: lean, checks, data.CurrentNov 21, 2026