Related papers: Complexity growth of a typical triangular billiard…
We investigate the semiclassical energy spectrum of quantum elliptic billiard. The nearest neighbor spacing distribution, level number variance and spectral rigidity support the notion that the elliptic billiard is a generic integrable…
It is known that the dynamics of planar billiards satisfies strong mixing properties (e.g. exponential decay of correlations) provided that some expansion condition on unstable curves is satisfied. This condition has been shown to always…
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 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.
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…
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…
A triangular graphenic billiard is defined as a planar carbon polymer in the H\"uckeloid approximation of $\pi-$band electrons. It is shown that the equilateral triangle of arbitrary size and zig-zag edges allows for exact solutions of the…
A study of the quantum triangular billiard requires consideration of a boundary value problem for the Green's function of the Laplacian on a trianglar domain. Our main result is a reformulation of this problem in terms of coupled…
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 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…
While many dynamical systems of mechanical origin, in particular billiards, are strongly chaotic -- enjoy exponential mixing, the rates of mixing in many other models are slow (algebraic, or polynomial). The dynamics in the latter are…
We consider classical dynamical properties of a particle in a constant gravitational force and making specular reflections with circular, elliptic or oval boundaries. The model and collision map are described and a detailed study of the…
We show that there exists a $C^2$ open dense set of convex bodies with smooth boundary whose billiard map exhibits a non-trivial hyperbolic basic set. As a consequence billiards in generic convex bodies have positive topological entropy and…
We study outer billiards with contraction outside regular polygons. For regular $n$-gons with $n = 3, 4, 5, 6, 8$, and $12$, we show that as the contraction rate approaches $1$, dynamics of the system converges, in a certain sense, to that…
Let $T\subset \R^{m+1}$ be a strictly convex domain bounded by a smooth hypersurface $X=\partial T$. In this paper we find lower bounds on the number of billiard trajectories in $T$ which have a prescribed intial point $A\in X$, a…
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 consider classical billiards on surfaces of constant curvature, where the charged billiard ball is exposed to a homogeneous, stationary magnetic field perpendicular to the surface. We establish sufficient conditions for hyperbolicity of…
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…
How complex must two finite 2-complexes be to admit a common, but not finite common, covering? We obtain an almost answer: the minimum possible number of triangles in a pseudo-simplicial triangulation of each complex is 3, 4, or 5.
We characterize quantum dynamics in triangular billiards in terms of five properties: (1) the level spacing ratio (LSR), (2) spectral complexity (SC), (3) Lanczos coefficient variance, (4) energy eigenstate localisation in the Krylov basis,…