Related papers: Complexity growth of a typical triangular billiard…

We provide a lower bound on the complexity function of a typical (in the Lebesgue measure sence) right triangular billiard.

We provide explicit lower estimates on the complexity growth in typical directions for a class of irrational triangle billiards

We establish a relationship between the word complexity and the number of generalized diagonals for a polygonal billiard. We conclude that in the rational case the complexity function has cubic upper and lower bounds. In the tiling case the…

We give an explicit sub-exponential estimate on the growth rate of periodic orbits and generalized diagonals for typical triangle 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 show that in a typical polygon the billiard map as well as its associated subshift obtained by coding orbits by the sequence of sides they visit are topologically weakly mixing.

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 prove that a polygonal billiard with one-sided mirrors has zero topological entropy. In certain cases we show sub exponential and for other polynomial estimates on the complexity.

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 prove that any sufficiently small perturbation of an isosceles triangle has a periodic billiard path. Our proof involves the analysis of certain infinite families of Fourier series that arise in connection with triangular billiards, and…

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…

The triangulation complexity of a compact 3-manifold is the minimal number of tetrahedra in any triangulation of the 3-manifold. We compute the triangulation complexity of all elliptic 3-manifolds and all sol 3-manifolds, to within a…

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…

The triangulation complexity of a closed orientable 3-manifold is the minimal number of tetrahedra in any triangulation of the manifold. The main theorem of the paper gives upper and lower bounds on the triangulation complexity of any…

We consider the set of polygons all of whose sides are vertical or horizontal with fixed combinatorics (for example all the figure "L"s). We show that there is a dense G $\delta$ subset of such polygons such that for each polygon in this G…

We study some dynamical properties of a classical time-dependent elliptical billiard. We consider periodically moving boundary and collisions between the particle and the boundary are assumed to be elastic. Our results confirm that although…

We prove that there exists a residual set of (non-rational) polygons such the billiard flow is weakly mixing with respect to the Liouville measure (on the unit tangent bundle to the billiard). This follows, via a Baire category argument,…

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.

Polygonalization of any smooth billiard boundary can be carried out in several ways. We show here that the semiclassical description depends on the polygonalization process and the results can be inequivalent. We also establish that…