Related papers: Complexity and growth for polygonal billiards
We show that the complexity of the billiard in a typical polygon grows cubically and the number of saddle connections grows quadratically along certain subsequences. It is known that the set of points whose first n-bounces hits the same…
We consider a subclass of tilings, the tilings obtained by cut and projection. Under somewhat standard assumptions, we show that the natural complexity function has polynomial growth. We compute its exponent \alpha in terms of the ranks of…
The complexity of the billiard language of regular polygons in the hyperbolic plane with $p$ sides and $2\pi/q$ internal angles is known to grow exponentially and the exponential growth rate is known to equal the topological entropy of the…
We provide a weakly exponential complexity upper bound for typical triangular billiards
We introduce a new method for estimating the growth of various quantities arising in dynamical systems. We apply our method to polygonal billiards on surfaces of constant curvature. For instance, we obtain power bounds of degree two plus…
We provide explicit lower estimates on the complexity growth in typical directions for a class of irrational triangle billiards
We provide a lower bound on the complexity function of a typical (in the Lebesgue measure sence) right triangular billiard.
We compute the complexity of the billiard language of the regular Euclidean $N$-gons (and other families of rational lattice polygons), answering a question posed by Cassaigne-Hubert-Troubetzkoy. Our key technical result is a counting…
We consider the billiard map in the hypercube of $\mathbb{R}^d$. We obtain a language by coding the billiard map by the faces of the hypercube. We investigate the complexity function of this language. We prove that $n^{3d-3}$ is the order…
We introduce the class of piecewise convex transformations, and study their complexity. We apply the results to the complexity of polygonal billiards on surfaces of constant curvature.
We consider outer billiard outside regular convex polygons. We deal with the case of regular polygons with $\{3,4,5,6,10\}$ sides, and we describe the symbolic dynamics of the map and compute the complexity of the language.
The article studies a generalization of the elliptic billiard to the complex domain. We show that the billiard orbits also have caustics, and that the number of such caustics is bigger than for the real case. For example, for a given…
We study the geometry of billiard orbits on rectangular billiards. A truncated billiard orbit induces a partition of the rectangle into polygons. We prove that thirteen is a sharp upper bound for the number of different areas of these…
We give a new proof for the directional billiard complexity in the cube, which was conjectured in \cite{Ra} and proven in \cite{Ar.Ma.Sh.Ta}. Our technique gives us a similar theorem for some rational polyhedra.
Revised version: some minor errors and typos fixed; exposition watered. Abstract: To a trajectory of a billiard in parallelogram we assign its symbolic trajectory - the sequence of numbers of coordinate plane, to which the faces met by the…
We give an explicit sub-exponential estimate on the growth rate of periodic orbits and generalized diagonals for typical triangle billiards.
An elementary application of Algorithmic Complexity Theory to the polygonal approximations of curved billiards-integrable and chaotic-unveils the equivalence of this problem to the procedure of quantization of classical systems: the scaling…
We study the classical motion in bidimensional polygonal billiards on the sphere. In particular we investigate the dynamics in tiling and generic rational and irrational equilateral triangles. Unlike the plane or the negative curvature…
This article is a contribution to the project of classifying the torsion growth of elliptic curve upon base-change. In this article we treat the case of elliptic curve defined over the rationals with complex multiplication. For this…
The classical inner and outer billiards can be formulated in variational terms, with length and area as the respective generating functions. The other two combinations, ``inner with area'' and ``outer with length,'' are more recently…