Related papers: Billiard complexity in the hypercube
The present paper presents and proves a proposition concerning the time complexity of finite languages. It is shown herein, that for any finite language (a language for which the set of words composing it is finite) there is a Turing…
Establishing global well-posedness and convergence toward equilibrium of the Boltzmann equation with specular reflection boundary condition has been one of the central questions in the subject of kinetic theory. Despite recent significant…
In this paper, we give detailed analysis and description of periodic trajectories of the billiard system within an ellipsoid in the 3-dimensional Minkowski space, taking into account all possibilities for the caustics. The conditions for…
We study the complexity of computing the mixed-integer hull $\operatorname{conv}(P\cap\mathbb{Z}^n\times\mathbb{R}^d)$ of a polyhedron $P$. Given an inequality description, with one integer variable, the mixed-integer hull can have…
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…
Cylindrical algebraic decomposition (CAD) is an important tool for the study of real algebraic geometry with many applications both within mathematics and elsewhere. It is known to have doubly exponential complexity in the number of…
We study a generalized three-dimensional stadium billiard and present strong numerical evidence that this system is completely chaotic. In this convex billiard chaos is generated by the defocusing mechanism. The construction of this…
The orbit closure of the unfolding of every rational right and isosceles triangle is computed and the asymptotic number of periodic billiard trajectories in these triangles is deduced. This follows by classifying all orbit closures of rank…
We prove that if the outer billiard map around a plane oval is algebraically integrable in a certain non-degenerate sense then the oval is an ellipse.
A general formula for the linearized Poincar\'e map of a billiard with a potential is derived. The stability of periodic orbits is given by the trace of a product of matrices describing the piecewise free motion between reflections and the…
It is established that the logarithm of the number of latin $d$-cubes of order $n$ is $\Theta(n^{d}\ln n)$ and the logarithm of the number of pairs of orthogonal latin squares of order $n$ is $\Theta(n^2\ln n)$. Similar estimations are…
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…
We show that two-dimensional billiard systems are Turing complete, in the sense that the halting of any Turing machine with a given input is equivalent to a certain bounded trajectory in this system entering a specified open set. Billiards…
We show that in a typical polygon the billiard map as well as its associated subshift obtained by coding orbits by the sequence of sides they visit are topologically weakly mixing.
Since the beginning of the quest of hypercomplex numbers in the late eighteenth century, many hypercomplex number systems have been proposed but none of them succeeded in extending the concept of complex numbers to higher dimensions. This…
In this work we study the geometrical properties of the high-lying eigenfunctions (200,000 and above) which are deep in the semiclassical regime. The system we are analyzing is the billiard system inside the region defined by the quadratic…
Inverting the vertices of elliptic billiard N-periodics with respect to a circle centered on one focus yields a new "focus-inversive" family inscribed in Pascal's Lima\c{c}on. The following are some of its surprising invariants: (i)…
We study the syntactic complexity of finite/cofinite, definite and reverse definite languages. The syntactic complexity of a class of languages is defined as the maximal size of syntactic semigroups of languages from the class, taken as a…
We initiate a systematic study of triplets of mutually unbiased bases (MUBs). We show that in $\mathbb{C}^d$ each MUB-triplet is characterized by a $d\times d\times d$ object that we call a Hadamard cube. We describe the basic properties of…
In this paper we consider the state complexity of an operation on formal languages, root(L). This naturally entails the discussion of the monoid of transformations of a finite set. We obtain good upper and lower bounds on the state…