Related papers: Billiard complexity in rational polyhedra
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…
A polygon is called rational if the angle between each pair of sides is a rational multiple of $\pi.$ The main theorem we will prove is Theorem 1: For rational polygons, periodic points of the billiard flow are dense in the phase space of…
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 provide explicit lower estimates on the complexity growth in typical directions for a class of irrational triangle billiards
For every quadrilateral sufficiently close to a rectangle, we shall show that it possess a periodic billiard path. This is an REU work done at ICERM in Summer 2012.
We study periodic infinite billiards in the plane. We show that for rational models, some particular obstacles can be added periodically, so that the billiard flow in the resulting table is recurrent in almost every direction.
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 optical physicist view of the problem of the trajectories in a polygonal billiard using only basic facts of Optics and the theory of functions of a complex variable. This approach allow us to stablish a certain correspondence…
We show a local rigidity result for the integrability of symplectic billiards. We prove that any domain which is close to an ellipse, and for which the symplectic billiard map is rationally integrable must be an ellipse as well. This is in…
We offer some theorems, mainly of finiteness, for certain patterns in elliptical billiards, related to periodic trajectories. For instance, if two players hit a ball at a given position and with directions forming a fixed angle in…
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 show that for a rational polygonal billiard, the set of pairs of points that do not illuminate each other (not connected by a billiard trajectory) is finite, and use the same method to extend the results of Leli\`evre, Monteil and Weiss,…
A caustic of a billiard is a curve whose tangent lines are reflected to its own tangent lines. A billiard is called Birkhoff caustic-integrable, if there exists a topological annulus adjacent to its boundary from inside that is foliated by…
We introduce the iteration theory for periodic billiard trajectories in a compact and convex domain of the Euclidean space, and we apply it to establish a multiplicity result for non-iterated trajectories.
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 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 study the problem of arithmetic billiards from a new perspective. We first raise a similar problem about reflecting lights inside grids. For the solution to this problem, we will give three proofs. Next, we consider a similar problem in…
We consider the billiard map inside a polyhedron. We give a condition for the stability of the periodic trajectories. We apply this result to the case of the tetrahedron. We deduce the existence of an open set of tetrahedra which have a…
We discuss a recent result by C. Culter: every polygonal outer billiard has a periodic trajectory.