Related papers: Complexity for billiards in regular N-gons
We present algorithms to compute generalized root systems of Nichols algebras of diagonal type and of contragredient Lie superalgebras. As a consequence, we obtain an algorithm to compute the Lyndon words in the Kharchenko PBW basis…
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…
The number of closed billiard trajectories in a rational-angled polygon grows quadratically in the length. This paper gives an analogue on K3 surfaces, by considering special Lagrangian tori. The analogue of the angle of a billiard…
We give an elementary approach to studying whether rings of $S$-integers in complex quadratic fields are Euclidean with respect to the $S$-norm.
We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates as well as Boolean operations on regions, interpreted over low-dimensional Euclidean spaces. We show that the complexity of…
This paper classifies the complexity of various teaching models by their position in the arithmetical hierarchy. In particular, we determine the arithmetical complexity of the index sets of the following classes: (1) the class of uniformly…
A comprehensive study of periodic trajectories of billiards within ellipsoids in $d$-dimensional Euclidean space is presented. The novelty of the approach is based on a relationship established between periodic billiard trajectories and…
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 investigate certain word-construction games with variable turn orders. In these games, Alice and Bob take turns on choosing consecutive letters of a word of fixed length, with Alice winning if the result lies in a predetermined target…
We study periodic wind-tree models, billiards in the plane endowed with $\mathbb{Z}^2$-periodically located identical connected symmetric right-angled obstacles. We show asymptotic formulas for the number of (isotopy classes of) closed…
Lensed billiards are an extension of the notion of billiard dynamical systems obtained by adding a potential function of the form $C1_{\mathcal{A}}$, where $C$ is a real valued constant and $1_{\mathcal{A}}$ is the indicator function of an…
We give a complete characterization of the relationship between the shape of a Euclidean polygon and the symbolic dynamics of its billiard flow. We prove that the only pairs of tables that can have the same bounce spectrum are right-angled…
We quantize the bending deformations of n-gon linkages by linearizing the bending fields at a degenerate n-gon to get a representation of the Malcev Lie algebra of the pure braid group. This linearization yields a flat connection on the…
Motivated by work of the first author, this paper studies symplectic embedding problems of lagrangian products that are sufficiently symmetric. In general, lagrangian products arise naturally in the study of billiards. The main result of…
Let $\mathcal{A}$ be the subdivision of $\mathbb{R}^d$ induced by $m$ convex polyhedra having $n$ facets in total. We prove that $\mathcal{A}$ has combinatorial complexity $O(m^{\lceil d/2 \rceil} n^{\lfloor d/2 \rfloor})$ and that this…
Given a planar compact convex billiard table $T$, we give an algorithm to find the shortest generalised closed billiard orbits on $T$. (Generalised billiard orbits are usual billiard orbits if $T$ has smooth boundary.) This algorithm is…
We prove some partial results on the periodicity of billiard systems on graphs. The results specialize to the case of $n$ billiards with equal mass on the unit interval or circle traveling at the same speed.
We study polygonal billiards with one-sided vertical mirror scattered on a square billiard table. We associate trajectories of these kinds of billiards with double rotations and study orbit behavior and questions of complexity.
We consider the complexities of substitutive sequences over a binary alphabet. By studying various types of special words, we show that, knowing some initial values, its complexity can be completely formulated via a recurrence formula…
We take two approaches to classifying the complexity of Presburger models: Scott analysis and degree spectra. In particular, we investigate the possible Scott sentence complexities and possible degree spectra of models of Presburger…