Complexity growth of a typical triangular billiard is weakly exponential (Q2227135)

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)].