Complexity growth of a typical triangular billiard is weakly exponential (Q2227135): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q115601886, #quickstatements; #temporary_batch_1722284575798 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q115601886 / rank | |||
Normal rank |
Latest revision as of 21:30, 29 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Complexity growth of a typical triangular billiard is weakly exponential |
scientific article |
Statements
Complexity growth of a typical triangular billiard is weakly exponential (English)
0 references
10 February 2021
0 references
A generalized diagonal of a polygonal billiard is an orbit which connects two vertices, whose length is calculated in terms of the number of billiard reflections. The main result of the paper is that for a typical (in the Lebesgue measure sense) triangular billiards a number of generalized diagonals of length no greater than \(n\) can be estimated from above by \(C\exp(n^\epsilon)\) for any \(\epsilon>0\). This gives a partial answer to a conjecture by \textit{A. Katok} [Commun. Math. Phys. 111, 151--160 (1987; Zbl 0631.58020)].
0 references
complexity function
0 references
triangular billiard
0 references
generalized diagonal
0 references
0 references