Answers are grounded in this paper and cite their sources.
The billiard table is modeled as an n-dimensional box [0,a₁]× [0,a₂]× … × [0,aₙ] ⊂ Rⁿ, with each side having real-valued lengths aᵢ that are pairwise commensurable. A ball is launched from the origin in direction d=(1,1,…,1). The ball is reflected if it hits the boundary of the billiard table. It comes to a halt when reaching a corner. We show that the number of intersections of the billiard curve at any given point on the table is either $0$ or a power of $2$. To prove this, we use algebraic and number theoretic tools to establish a bijection between the number of intersections of the billiard curve and the number of satisfying assignments of a specific constraint satisfaction problem.
No takes yet. Share an insight, caveat, or question.
Clemen et al. (2024) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: