Related papers: Billiard complexity in the hypercube
Since the seminal work of Sinai one studies chaotic properties of planar billiards tables. Among them is the study of decay of correlations for these tables. There are examples in the literature of tables with exponential and even…
We study the birational maps of $\mathbb{P}^3_\mathbb{C}$. More precisely we describe the irreducible components of the set of birational maps of bidegree $(3,3)$ (resp. $(3,4)$, resp. $(3,5)$).
In this paper we are constructing integer lattice squares, cubes or hypercubes in $\mathbb R^d$ with $d\in \{2,3,4\}$. For squares and cubes we find a complete description of their Ehrhart polynomial. For hypercubes, we compute one of the…
The locus of centers of inscribed circles in triangles, the 3-periodic orbits of an elliptic billiard, is also an ellipse. In this work we obtain the canonical equation of this ellipse, complementing the previous results obtained by O.…
This article presents a new method to calculate eigenvalues of right triangle billiards. Its efficiency is comparable to the boundary integral method and more recently developed variants. Its simplicity and explicitness however allow new…
In areas as diverse as contemporary art, play structures, climbing equipment, and modular construction toys, we see the presence of building block-like polyhedral complexes, which are generalizations of the pieces in the game Tetris. We…
In this paper we introduce and study a new complexity measure for finite words. For positive integer $d$ special scattered subwords, called super-$d$-subwords, in which the gaps are of length at least $(d-1)$, are defined. We give methods…
Let $X$ be a finite set in $Z^d$. We consider the problem of optimizing linear function $f(x) = c^T x$ on $X$, where $c\in Z^d$ is an input vector. We call it a problem $X$. A problem $X$ is related with linear program $\max\limits_{x \in…
In this article we further develop methods for representing integers as a sum of three cubes. In particular, a barrier to solving the case $k=3$, which was outlined in a previous paper of the second author, is overcome. A very recent…
We prove that the determinantal complexity of a hypersurface of degree $d > 2$ is bounded below by one more than the codimension of the singular locus, provided that this codimension is at least $5$. As a result, we obtain that the…
This paper classifies the complexity of various teaching models by their position in the arithmetical hierarchy. In particular, we determine the arithmetical complexity of the index sets of the following classes: (1) the class of uniformly…
We consider the billiard map inside a polyhedron. We give a condition for the stability of the periodic trajectories. We apply this result to the case of the tetrahedron. We deduce the existence of an open set of tetrahedra which have a…
The complexity class DP is the class of all languages that are the intersection of a language in NP and a language in coNP. It was conjectured that recognizing a facet for the knapsack polytope is DP-complete. We provide a positive answer…
The extension complexity of a polytope measures its amenability to succinct representations via lifts. There are several versions of extension complexity, including linear, real semidefinite, and complex semidefinite. We focus on the last…
We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…
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…
In this paper we give a mathematical model for a game that we call picture cube puzzle and investigate its properties. The central question is the number of moves required to solve the puzzle. A mathematical discussion is followed by the…
We illustrate the theory of one-dimensional pluri-Lagrangian systems with the example of commuting billiard maps in confocal quadrics.
We study geometry of confocal quadrics in pseudo-Euclidean spaces of an arbitrary dimension $d$ and any signature, and related billiard dynamics. The goal is to give a complete description of periodic billiard trajectories within…
We explore the triangle outer billiards map in points at infinity in the hyperbolic plane, focusing on the rotation number. Building on Dogru and Tabachnikov's work, which established the conditions for triangles where the rotation number…