ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KnK_n be the upper bound on the number of smooth pieces into which the nnth iterate of a smooth convex expanding submanifold is chopped by the billiard map. Complexity hypothesis. For typical three-dimensional billiards with smooth scatterers and finite horizon, there exists a number λ>1\lambda>1, strictly less than the smallest expansion rate on the unstable cones of the billiard, such that

Kn=o(λn).K_n=o(\lambda^n).

Here typicality may be understood, for example, with respect to the CrC^r topology on the scatterers for r≥3r\geq 3. The hypothesis is intended to control the effect of singularities relative to hyperbolicity and is presented as an open assumption needed for extending correlation-decay results to higher-dimensional billiards.

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.