Related papers: Complexity for billiards in regular N-gons
We consider zigzags in thin complexes. The main result states that the sum of the lengths of all zigzags in an $n$-complexe is equal to the sum of the lengths of all zigzags in all $(n-1)$-faces of this complex, and this sum also is the…
We show that the Word Problem in finitely generated subgroups of $\textsf{GL}_d(\mathbb{Z})$ can be solved in linear average-case complexity. This is done under the bit-complexity model, which accounts for the fact that large integers are…
Grothendieck proved that any finite epimorphism of noetherian schemes factors into a finite sequence of effective epimorphisms. We define the complexity of a flat groupoid $R\rightrightarrows X$ with finite stabilizer to be the length of…
We consider polygonal billiards and we show the uniqueness of coding of non-periodic billiard trajectories in polygons whose holes have non-zero minimal diameters, generalising a theorem of Galperin, Kr\"uger and Troubetzkoy.
In this paper, we study the complexity of p-adic continued fractions of a rational number, which is the p-adic analogue of the theorem of Lame. We calculate the length of Browkin expansion, and the length of Schneider expansion. Also, some…
We use Ratner's theorem to compute the asymptotics of the number of (cylinders of) periodic trajectories in a rectangle with a barrier, assuming that the location p/q of the barrier is rational. We also show that as q tends to infinity, the…
We introduce and prove numerous new results about the orbits of the $T$-fractal billiard. Specifically, in Section 3, we give a variety of sufficient conditions for the existence of a sequence of compatible periodic orbits. In Section 4, we…
We study approximations of billiard systems by lattice graphs. It is demonstrated that under natural assumptions the graph wavefunctions approximate solutions of the Schroedinger equation with energy rescaled by the billiard dimension. As…
The geodesic complexity of a length space $X$ quantifies the required number of case distinctions to continuously choose a shortest path connecting any given start and end point. We prove a local lower bound for the geodesic complexity of…
By making use of the greatest common divisor's ($gcd$) properties we can highlight some connections between playing billiard inside a unit square and the Fibonacci sequence as well as the Euclidean algorithm. In particular by defining two…
In this thesis, we study the place of regular languages within the communication complexity setting. In particular, we are interested in the non-deterministic communication complexity of regular languages. We show that a regular language…
We introduce a new class of billiard-like system, ``bouncing outer billiards" which are 3-dimensional cousins of outer billiards of Neumann and Moser. We prove that bouncing outer billiard on a smooth convex body has at least four…
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 and prove some basic results about a combinatorial model which produces embedded polygons in the plane. The model is closely related to outer billiards on kites, and also is related to corner percolation, to Hooper's Truchet…
As in a symmetric space of noncompact type, one can associate to an oriented geodesic segment in a Euclidean building a vector valued length in the Euclidean Weyl chamber; in addition to the metric length it contains information on the…
A graph is called (generically) rigid in $\mathbb{R}^d$ if, for any choice of sufficiently generic edge lengths, it can be embedded in $\mathbb{R}^d$ in a finite number of distinct ways, modulo rigid transformations. Here we deal with the…
We prove that the geodesic complexity of a regular tetrahedron exceeds its topological complexity by 1 or 2. The proof involves a careful analysis of minimal geodesics on the tetrahedron.
We give a solution to the word problem for the singular braid monoid SB_n. The complexity of the algorithm is quadratic in the product of the word length and the number of the singular generators in the word. Furthermore we algebraically…
We consider 3-periodic orbits in an elliptic billiard. Numerical experiments conducted by Dan Reznik have shown that the locus of the centers of inscribed circles of the corresponding triangles is an ellipse. We prove this fact by 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…