相关论文: Complexity of Billiards in Polygons Associated to …
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 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 billiard systems within compact domains bounded by confocal conics on a hyperboloid of one sheet in the Minkowski space. We derive conditions for elliptic periodicity for such billiards. We describe the topology of those…
This paper studies balance properties for billiard words. Billiard words generalize Sturmian words by coding trajectories in hypercubic billiards. In the setting of aperiodic order, they also provide the simplest examples of quasicrystals,…
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 study billiards in domains enclosed by circular polygons. These are closed $C^1$ strictly convex curves formed by finitely many circular arcs. We prove the existence of a set in phase space, corresponding to generic sliding trajectories…
We consider polygonal billiards with collisions contracting the reflection angle towards the normal to the boundary of the table. In previous work, we proved that such billiards has a finite number of ergodic SRB measures supported on…
In this paper I will unite two games, symplectic billiards and tiling billiards. The new game is called symplectic tiling billiards. I will prove a result about periodic orbits of symplectic tiling billiards in a very special case and then…
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…
Let $f: [0, +\infty) \to (0, +\infty)$ be a sufficiently smooth convex function, vanishing at infinity. Consider the planar domain $Q$ delimited by the positive $x$-semiaxis, the positive $y$-semiaxis, and the graph of $f$. Under certain…
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…
Let $q \ge 3$ be a period. There are at least two $(1,q)$-periodic trajectories inside any smooth strictly convex billiard table, and all of them have the same length when the table is an ellipse or a circle. We quantify the chaotic…
In this paper, we remind previous results about the tilings $\{p,q\}$ of the hyperbolic plane. We introduce two new ways to split the hyperbolic plane in order to algorithmically construct the tilings $\{p,q\}$ when $q$ is odd.
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 study polygonal billiards with reflection laws contracting the reflected angle towards the normal. It is shown that if a polygon does not have parallel sides facing each other, then the corresponding billiard map has finitely many…
We establish sufficient conditions for the hyperbolicity of the billiard dynamics on surfaces of constant curvature. This extends known results for planar billiards. Using these conditions, we construct large classes of billiard tables with…
We provide a weakly exponential complexity upper bound for typical triangular billiards
We show that two-dimensional billiard systems are Turing complete, in the sense that the halting of any Turing machine with a given input is equivalent to a certain bounded trajectory in this system entering a specified open set. Billiards…
It is well-known that billiards in polygons cannot be chaotic (hyperbolic). Particularly Kolmogorov-Sinai entropy of any polygonal billiard is zero. We consider physical polygonal billiards where a moving particle is a hard disc rather than…
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…