Cited by 73Mathematical Dynamics and FractalsQuantum chaos and dynamical systemsMathematics and Applications

Uniform Estimates on the Number of Collisions in Semi-Dispersing Billiards

Burago, D., Ferleger, S., Kononenko, A.·1998·The Annals of Mathematics

Abstract

Estimating the number of collisions in a neighborhood of a given is a central problem in the theory of billiard systems. Moreover, the existence of a uniform estimate on the number of collisions is related to various important properties of a billiard system. For example, the Sinai-Chernov formulas for the metric entropy of billiards are proved under the assumption that such an estimate exists ([3], [9]). It is quite obvious that if the boundary of the billiard has any concave parts then a trajectory can have arbitrarily many collisions in a neighborhood of a point of concavity, and sometimes even infinitely many collisions (see, for example [11]). Therefore, the class of billiards for which uniform estimates are possible are the semi-dispersing billiards, which have been studied extensively in the numerous works (see the review in [7]). The most important examples of semi-dispersing billiards are the billiards that correspond to hard balls gas models. Vaserstein (1979, [11]) and Gal'perin (1981, [4]) proved that in semidispersing billiards any trajectory has only finitely many collisions in any finite period of time. Sinai (1978, [8]) proved the existence of a uniform estimate for billiards inside polyhedral angles, and pointed out that his results should also hold for semi-dispersing billiards in a neighborhood of a x with linearly independent normals to the walls of the billiard at x (see the remark at the end of [8]). In this paper we deal with semi-dispersing billiards on arbitrary manifolds. All our results apply to the usual billiards in Rk and Wk. First we prove that for semi-dispersing billiards on arbitrary manifolds any trajectory has only a finite number of collisions in a finite period of time.

Integrity signals

Registry

Crossref · 10.2307/120962

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Authors
Burago, D., Ferleger, S., & Kononenko, A.
Venue
The Annals of Mathematics
Publisher
JSTOR
Published
1998-05
Volume
147
Issue
3
Pages
695
ISSN
0003-486X (ISSN-L)
OpenAlex
W2095564544
Cited by
73
References
0
Citations by year
2026: 5 · 2025: 3 · 2024: 3 · 2023: 4 · 2022: 7 · 2021: 4 · 2020: 5 · 2019: 3 · 2018: 1 · 2017: 5 · 2016: 2 · 2012: 1
FWCI
4.54
Type
journal article
Language
en
Open access
closed
Locations
Annals of Mathematics (publishedVersion)
Topics
  • Physical Sciences › Mathematics › Mathematical Physics › Mathematical Dynamics and Fractals
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Quantum chaos and dynamical systems
  • Physical Sciences › Mathematics › Geometry and Topology › Mathematics and Applications
Keywords
number of collisions, uniform estimates, metric entropy, billiard trajectories

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review