Related papers: Complexity of Trajectories in Rectangular Billiard…
This work continues the study of tiling billiards, a class of dynamical system introduced by Davis et al. in 2018. We develop the study of generalized tiling billiards in a cyclic polygon. This work shows that the behavior of generalized…
In this article we undertake a study of extension complexity from the perspective of formal languages. We define a natural way to associate a family of polytopes with binary languages. This allows us to define the notion of extension…
The power of symbolic computation, as opposed to mere numerical computation, is illustrated with efficient algorithms for studying the generalized gambler's ruin problem in one and two dimensions. We also consider a new generalization of…
Billiards in ellipses have a confocal ellipse or hyperbola as caustic. The goal of this paper is to prove that for each billiard of one type there exists an isometric counterpart of the other type. Isometry means here that the lengths of…
We prove that a bounded domain $\Omega$ in $\R^n$ with smooth boundary has a periodic billiard trajectory with at most $n+1$ bounce times and of length less than $C_n r(\Omega)$, where $C_n$ is a positive constant which depends only on $n$,…
We consider billiards obtained by removing three strictly convex obstacles satisfying the non-eclipse condition on the plane. The restriction of the dynamics to the set of non-escaping orbits is conjugated to a subshift on three symbols…
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,…
We study resonant billiard trajectories within quadrics in the $d$-dimensional Euclidean space. We relate them to the theory of approximation, in particular the extremal rational functions on the systems of $d$ intervals on the real line.…
We consider the problem of finding a 1-planar drawing for a general graph, where a 1-planar drawing is a drawing in which each edge participates in at most one crossing. Since this problem is known to be NP-hard we investigate the…
In this paper, we provide an $O(n \mathrm{polylog} n)$ bound on the expected complexity of the randomly weighted Voronoi diagram of a set of $n$ sites in the plane, where the sites can be either points, interior-disjoint convex sets, or…
Billiard models of single particles moving freely in two-dimensional regions enclosed by hard walls, have long provided ideal toy models for the investigation of dynamical systems and chaos. Recently, billiards with (semi-)permeable walls…
In combinatorics on words, a classical topic of study is the number of specific patterns appearing in infinite sequences. For instance, many works have been dedicated to studying the so-called factor complexity of infinite sequences, which…
A reformulation of the path length of binary search trees is given in terms of permutations, allowing to extend the definition to the instance of words, where the letters are obtained by independent geometric random variables (with…
We discuss the interplay between the piece-line regular and vertex-angle singular boundary effects, related to integrability and chaotic features in rational polygonal billiards. The approach to controversial issue of regular and irregular…
We consider the billiard dynamics in a strip-like set that is tessellated by countably many translated copies of the same polygon. A random configuration of semidispersing scatterers is placed in each copy. The ensemble of dynamical systems…
We consider finite trees with edges labeled by letters on a finite alphabet $\varSigma$. Each pair of nodes defines a unique labeled path whose trace is a word of the free monoid $\varSigma^*$. The set of all such words defines the language…
Consider a face F in an arrangement of n Jordan curves in the plane, no two of which intersect more than s times. We prove that the combinatorial complexity of F is O(\lambda_s(n)), O(\lambda_{s+1}(n)), and O(\lambda_{s+2}(n)), when the…
We study the complexity of S-adic sequences corresponding to a family of 216 multi-dimensional continued fractions maps, called Triangle Partition maps (TRIP maps), with an emphasis on those with low upper bounds on complexity. Our main…
The arithmetic triangular billiards are classically chaotic but have Poissonian energy level statistics, in ostensible violation of the BGS conjecture. We show that the length spectra of their periodic orbits divides into subspectra…
Given a strictly convex domain $\Omega$ in $\R^2$, there is a natural way to define a billiard map in it: a rectilinear path hitting the boundary reflects so that the angle of reflection is equal to the angle of incidence. In this paper we…