ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Unfold a billiard trajectory in a regular nn-gon by reflecting the polygon across each encountered side. A short trajectory joins two vertices and meets no vertex in between; a reachable point is an endpoint vertex occurring in such an unfolding. For an oriented short trajectory, let α\alpha and β\beta be its source and target endpoint angles as in Definition 2.1 of the source, and write AkA_k for the resulting one of n−2n-2 trajectory types (indices modulo n−2n-2); in particular A0A_0 is characterized by β−α=2π/n\beta-\alpha=2\pi/n. For n≥5n\ge5, call reachable points u,vu,v of type A0A_0 a unitary pair if det⁡(u,v)=sin⁡((n−2)π/n)\det(u,v)=\sin((n-2)\pi/n), and put λ=2cos⁡(π/n)\lambda=2\cos(\pi/n). Prove: (a) um=u+m(λ+1)vu_m=u+m(\lambda+1)v is reachable of type A0A_0 for every integer mm for which it lies in the upper half-plane; (b) wm=u+(λ+m(λ+1))vw_m=u+(\lambda+m(\lambda+1))v is reachable of type A1A_1 whenever it lies there; (c) there are no other reachable points on u+Rvu+\mathbb Rv; and (d) the analogous description on v+Ruv+\mathbb Ru yields only types A0A_0 and An−3A_{n-3}.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.