Related papers: Code & order in polygonal billiards
Periodic orbits are the central ingredients of modern semiclassical theories and corrections to these are generally non-classical in origin. We show here that for the class of generic polygonal billiards, the corrections are predominantly…
We study billiards in plane domains, with a perpendicular magnetic field and a potential. We give some results on periodic orbits, KAM tori and adiabatic invariants. We also prove the existence of bound states in a related scattering…
Bar Codes are combinatorial objects encoding many properties of monomial ideals. In this paper we employ these objects to study Janet-like divisions. Given a finite set of terms U, from its Bar Code we can compute the Janet-like…
We study non-Birkhoff periodic orbits in symmetric convex planar billiards. Our main result provides a quantitative criterion for the existence of such orbits with prescribed minimal period, rotation number, and spatiotemporal symmetry. We…
We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the obtained codes share most properties of cyclic codes. Since…
The famous conjecture of V.Ya.Ivrii (1978) says that {\it in every billiard with infinitely-smooth boundary in a Euclidean space the set of periodic orbits has measure zero}. In the present paper we study the complex version of Ivrii's…
The conjugation problem for billiard maps conjectures that if two strictly convex billiards have conjugated billiard maps, the billiard tables must be homothetic to each other. We show that if two billiard maps are conjugated, the…
Interpolation theory for complex polynomials is well understood. In the non-commutative quaternionic setting, the polynomials can be evaluated "on the left" and "on the right". If the interpolation problem involves interpolation conditions…
It is an open question whether the fractional parts of nonlinear polynomials at integers have the same fine-scale statistics as a Poisson point process. Most results towards an affirmative answer have so far been restricted to almost sure…
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…
In this paper, we describe linear and cyclic codes over the rings of the form $R_{s,p}=\mathbb{Z}_{p}[u]/\left( f\left(u\right) /\left( u-s\right) \right)$, where $p$ is a prime number and $f\left( u\right) =u^{p}-u$, with $s\in…
A complementary Gray code for binary n-tuples is one that, when all the tuples are complemented, is identical to itself; this is equivalent to the complement of the first half of the code being identical to the second half. We generalize…
A regular polyhedron of type {p, q} has at least 2pq flags, and it is called tight if it has exactly 2pq flags. The values of p and q for which there exist tight orientably regular polyhedra were previously known. We determine for which…
We study the dissection of a square into congruent convex polygons. Yuan \emph{et al.} [Dissecting the square into five congruent parts, Discrete Math. \textbf{339} (2016) 288-298] asked whether, if the number of tiles is a prime number…
The classical dynamics of the isotropic two-dimensional harmonic oscillator confined by an elliptic hard wall is discussed. The interplay between the harmonic potential with circular symmetry and the boundary with elliptical symmetry does…
Polycyclic codes are a generalization of cyclic and constacyclic codes. Even though they have been known since 1972 and received some attention more recently, there have not been many studies on polycyclic codes. This paper presents an…
The following numerical control over the topological equivalence is proved: two complex polynomials in $n\not= 3$ variables and with isolated singularities are topologically equivalent if one deforms into the other by a continuous family of…
A binary triangle of size $n$ is a triangle of zeroes and ones, with $n$ rows, built with the same local rule as the standard Pascal triangle modulo $2$. A binary triangle is said to be balanced if the absolute difference between the…
The configuration manifold $M$ of a mechanical system consisting of two unconstrained rigid bodies in $\mathbb{R}^n$, $n\geq 1$, is a manifold with boundary (typically with singularities.) A complete description of the system requires…
A convex polygon $Q$ is inscribed in a convex polygon $P$ if every side of $P$ contains at least one vertex of $Q$. We present algorithms for finding a minimum area and a minimum perimeter convex polygon inscribed in any given convex…