Related papers: Complexity lower bound for typical right triangula…

We provide a weakly exponential complexity upper bound for typical triangular billiards

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 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…

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…

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 establish a lower bound on the complexity orientable locally orientable geometric 3-orbifolds in terms of Delzant's T-invariants of their orbifold-fundamental groups, generalizing previously known bounds for complexity of 3-manifolds.

This article presents a new method to calculate eigenvalues of right triangle billiards. Its efficiency is comparable to the boundary integral method and more recently developed variants. Its simplicity and explicitness however allow new…

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 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 derive Moore-type upper bounds for regular simplicial complexes and present logarithmic lower bounds on their diameter based on minimum degree.

In a hyperbolic polygon any finite collection of closed billiard trajectories can be assigned an average length function. In this paper, we consider the average length of the collection of cyclically related closed billiard trajectories in…

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…

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…

A right triangular billiard system is equivalent to the system of two colliding particles confined in a one-dimensional box. In spite of their seeming simplicity, no definite conclusion has been drawn so far concerning their ergodic…

We determine a reasonable upper bound for the complexity of collection from the left to multiply two elements of a finite soluble, or polycyclic, group by restricting attention to certain polycyclic presentations of the group.

A new lower bound on the complexity of a 3-manifold is given using the Z2-Thurston norm. This bound is shown to be sharp, and the minimal triangulations realising it are characterised using normal surfaces consisting entirely of…

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…

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…

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,…