Generic bounded-complexity conjecture for dispersing billiard tables
Statement
Let be a finite horizon dispersing billiard map, and let be the maximum number of curves in that intersect at one point. The sequence of complexities is bounded if there exists such that
Bounded-complexity conjecture. For typical finite horizon dispersing billiard configurations, the sequence of complexities is bounded.
The known general estimate is only linear, namely for some . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.