Related papers: Complexity and growth for polygonal billiards
In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…
The classical Birkhoff conjecture claims that the boundary of a strictly convex integrable billiard table is necessarily an ellipse (or a circle as a special case). In this article we prove a complete local version of this conjecture: a…
Consider two $k$-gons $P$ and $Q$. We say that the billiard flows in $P$ and $Q$ are homotopically equivalent if the set of conjugacy classes in the fundamental group of $P$ which contain a periodic billiard orbit agrees with the analogous…
We study the computational complexity of an important property of simple, regular and weighted games, which is decisiveness. We show that this concept can naturally be represented in the context of hypergraph theory, and that decisiveness…
We propose a physical model of speech to explain its precision and robustness. We begin by reducing the dynamics to the bare minimum of polygonal billiards. The symbolic stability of the billiard trajectories against variations in action…
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…
We explain the construction of minimal tilting complexes for objects of highest weight categories and we study in detail the minimal tilting complexes for standard objects and simple objects. For certain categories of representations of…
In this experimental work we study billiard trajectories in triangular pyramids and try to establish conditions that guarantee the existence (or absence) of 4-cycles (there can be not more, than three of them). We formulate conjectures and…
This is an updated and expanded version of our earlier survey article \cite{Gut5}. Section $\S 1$ introduces the subject matter. Sections $\S 2 - \S 4$ expose the basic material following the paradigm of elliptic, hyperbolic and parabolic…
A system of two masses connected with a weightless rod (called dumbbell in this paper) interacting with a flat boundary is considered. The sharp bound on the number of collisions with the boundary is found using billiard techniques. In…
A billiard in the form of a stadium with periodically perturbed boundary is considered. Two types of such billiards are studied: stadium with strong chaotic properties and a near-rectangle billiard. Phase portraits of such billiards are…
The paper establishes the property of splittability of billiard boundary sequences in n dimensional cube into subsequences of fractional parts. This reveals a new property of integrable and weak perturbated Hamilton systems: under a simple…
In an ordinary billiard trajectories of a Hamiltonian system are elastically reflected after a collision with a hypersurface (scatterer). If the scatterer is a submanifold of codimension more than one, we say that the billiard is…
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…
We introduce an algebraic formulation of billiards on plane curves over algebraically closed fields, extending Glutsyuk's complex billiards. For any smooth algebraic curve $C$ of degree $d \geq 2$, algebraic billiards is a rational…
We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…
We show that the 2-abelian complexity of the infinite Thue-Morse word is 2-regular, and other properties of the 2-abelian complexity, most notably that it is a concatenation of palindromes of increasing length. We also show sharp bounds for…
We introduce fibrewise Whitehead- and fibrewise Ganea definitions of monoidal topological complexity. We then define several lower bounds for the topological complexity, which improve on the standard lower bound in terms of nilpotency of…
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 develop a framework for dealing with smooth approximations to billiards with corners in the two-dimensional setting. Let a polygonal trajectory in a billiard start and end up at the same billiard's corner point. We prove that smooth…