ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let MM be a polygon, let PnP_n denote the number of generalized diagonals of MM whose discrete length is at most nn, and let ϵ>0\epsilon>0. Katok's conjecture. For every polygon MM and every ϵ>0\epsilon>0, there is a constant C(M,ϵ)C(M,\epsilon) such that

Pn<C(M,ϵ)n2+ϵ.P_n<C(M,\epsilon)n^{2+\epsilon}.

This conjecture seeks an explicit sub-exponential bound for the growth of generalized diagonals in arbitrary, including irrational-angled, polygonal billiards. Masur's quadratic estimates settle the corresponding order of growth for rational-angled polygons, but the general case is described as a difficult open problem.

Record

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.