Related papers: Lower bounds on directional complexity for irratio…
We provide a weakly exponential complexity upper bound for typical triangular billiards
We provide a lower bound on the complexity function of a typical (in the Lebesgue measure sence) right triangular billiard.
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 find an upper estimate for a splitting time of a thin parallel beam for irrational triangle billiards in terms of some number-theoretic function of angles. We provide an upper estimate on this function for some class of angles.
We give an explicit sub-exponential estimate on the growth rate of periodic orbits and generalized diagonals for typical triangle billiards.
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 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 give the asymptotic growth of the number of primitive periodic trajectories of a two dimensional dispersive billiard, when we prescribe their number of bounces on one of the obstacles.
The orbit closure of the unfolding of every rational right and isosceles triangle is computed and the asymptotic number of periodic billiard trajectories in these triangles is deduced. This follows by classifying all orbit closures of rank…
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.
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.
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…
There is an open set of right triangles such that for each irrational triangle in this set (i) periodic billiards orbits are dense in the phase space, (ii) there is a unique nonsingular perpendicular billiard orbit which is not periodic,…
We give lower bound on the number of periodic billiard trajectories inside a generic smooth strictly convex closed surface in 3-space: for odd n, there are at least 2(n-1) such trajectories. We apply a topological approach based on the…
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…
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 give topological lower bounds on the number of periodic and closed trajectories in strictly convex smooth billiards. We use variational reduction admitting a finite group of symmetries and apply topological approach based on equivariant…
We obtain an upper bound of the number of collisions of any billiard trajectory in a polyhedral angle in terms of the minimal eigenvalue of a positive definite matrix which characterizes the angle. Elements of the matrix are scalar products…
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 polynomial upper bounds for the deviation of ergodic averages for the straight line flow on every translation surface in almost every direction, in particular for those surfaces arising from rational polygonal billiards.