ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a finite horizon dispersing billiard map, and let KnK_n be the maximum number of curves in Sn{\mathcal{S}}_n that intersect at one point. The sequence of complexities is bounded if there exists K>0K>0 such that

Kn≤Kfor all n∈Z.K_n \leq K \quad \text{for all } n \in \mathbb{Z}.

Bounded-complexity conjecture. For typical finite horizon dispersing billiard configurations, the sequence of complexities KnK_n is bounded.

The known general estimate is only linear, namely Kn≤K∣n∣K_n\leq K|n| for some K>0K>0. The conjecture is refuted when the table has a periodic orbit with a grazing collision, although the sparse recurrence condition may still hold in that case.

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.