Related papers: Billiard complexity in the hypercube

The article studies a generalization of the elliptic billiard to the complex domain. We show that the billiard orbits also have caustics, and that the number of such caustics is bigger than for the real case. For example, for a given…

The Sudoku puzzle has achieved worldwide popularity recently, and attracted great attention of the computational intelligence community. Sudoku is always considered as Satisfiability Problem or Constraint Satisfaction Problem. In this…

The Rubik's cube is a famous puzzle in which faces can be moved and the corresponding movement operations define a group. We consider here a generalization to any $3$-valent map. We prove an upper bound on the size of the corresponding…

Given a random map (T_1, T_2, T_3, T_4, p_1, p_2, p_3, p_4), we define a random billiard map on a surface of constant curvature (Euclidean plane, hyperbolic plane, or the sphere). The Liouville measure is invariant for this billiard map.…

We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n halfspaces, with the property that the highest dimension of any bounded face is much smaller than D. We show that, if d is the maximum…

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…

We study the problem of arithmetic billiards from a new perspective. We first raise a similar problem about reflecting lights inside grids. For the solution to this problem, we will give three proofs. Next, we consider a similar problem in…

For the first time a three--dimensional (3D) chaotic billiard -- the 3D Sinai billiard -- was quantized, and high--precision spectra with thousands of eigenvalues were calculated. We present here a semiclassical and statistical analysis of…

This is the first survey of highly excited eigenstates of a chaotic 3D billiard. We introduce a strongly chaotic 3D billiard with a smooth boundary and we manage to calculate accurate eigenstates with sequential number (of a 48-fold…

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…

E. Gutkin found a remarkable class of convex billiard tables in the plane which have a constant angle invariant curve. In this paper we prove that in dimension 3 only round sphere has such a property. For dimension greater than 3 it must be…

Let $Q_d$ be the hypercube of dimension $d$ and let $H$ and $K$ be subsets of the vertex set $V(Q_d)$, called configurations in $Q_d$. We say that $K$ is an \emph{exact copy} of $H$ if there is an automorphism of $Q_d$ which sends $H$ onto…

The problem of two interacting particles moving in a d-dimensional billiard is considered here. A suitable coordinate transformation leads to the problem of a particle in an unconventional hyperbilliard. A dynamical map can be readily…

We define an invariant, which we call surface-complexity, of compact 3-manifolds by means of Dehn surfaces. The surface-complexity is a natural number measuring how much the manifold is complicated. We prove that it fulfils interesting…

By a (latin) unitrade, we call a set of vertices of the Hamming graph that is intersects with every maximal clique in $0$ or $2$ vertices. A bitrade is a bipartite unitrade, that is, a unitrade splittable into two independent sets. We study…

We provide a weakly exponential complexity upper bound for typical triangular billiards

In this paper we are interested in the motion of a ball inside a billiard table bounded by a particular smooth curve. This table belongs to a family of billiards which can all be drawn by a common process: the so-called gardener's string…

An elementary application of Algorithmic Complexity Theory to the polygonal approximations of curved billiards-integrable and chaotic-unveils the equivalence of this problem to the procedure of quantization of classical systems: the scaling…

We consider two nested billiards in $\mathbb R^d$, $d\geq3$, with $C^2$-smooth strictly convex boundaries. We prove that if the corresponding actions by reflections on the space of oriented lines commute, then the billiards are confocal…

A triangle center such as the incenter, barycenter, etc., is specified by a function thrice- and cyclically applied on sidelengths and/or angles. Consider the 1d family of 3-periodics in the elliptic billiard, and the loci of its triangle…