Related papers: Code & order in polygonal billiards
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…
In this article we study the dynamics of one-dimensional relativistic billiards containing particles with positive and negative energy. We study configurations with two identical positive masses and symmetric positions with two massless…
A kind of self-dual quasi-abelian codes of index $2$ over any finite field $F$ is introduced. By counting the number of such codes and the number of the codes of this kind whose relative minimum weights are small, such codes are proved to…
We study the dynamics of one-particle and few-particle billiard systems in containers of various shapes. In few-particle systems, the particles collide elastically both against the boundary and against each other. In the one-particle case,…
In the present note, we uncover a remarkable connection between the length of periodic orbit of a classical particle enclosed in a class of 2-dimensional planar billiards and the energy of a quantum particle confined to move in an identical…
Let $K$ be a field, $R=K[x, y]$ the polynomial ring and $\mathcal{M}(K)$ the set of all pairs of square matrices of the same size over $K.$ Pairs $P_1=(A_1,B_1)$ and $P_2=(A_2,B_2)$ from $\mathcal{M}(K)$ are called similar if…
We establish a relationship between the word complexity and the number of generalized diagonals for a polygonal billiard. We conclude that in the rational case the complexity function has cubic upper and lower bounds. In the tiling case the…
The aim of this paper is to study quasi-rational polygons related to the outer billiard. We compare different notions introduced, and make a synthesis of those.
We improve on the lower bound of the maximum number of planes of ${\rm PG}(8,q)$ mutually intersecting in at most one point leading to the following lower bound: ${\cal A}_q(9, 4; 3) \ge q^{12}+2q^8+2q^7+q^6+q^5+q^4+1$ for constant…
We obtain an upper bound of the number of collisions of any billiard trajectory in a polyhedral angle in terms of the minimal eigenvalue of a positive definite matrix which characterizes the angle. Elements of the matrix are scalar products…
Binary self-orthogonal codes and balanced incomplete block designs are two combinatorial configurations that have been much studied because of their wide areas of application. In this paper, we have shown the distribution of (16; 6;…
We propose geometric tools that are suitable for studying the behavior of a billiard trajectory in a homogeneous force field. Two examples are considered: a vertical plane with an open top and with a parabolic or right angle boundary at the…
If D is a rational polygon, then the associated rational billiard table is given by \Omega(D). Such a billiard table is well understood. If F is a closed fractal curve approximated by a sequence of rational polygons, then the corresponding…
Closed billiard trajectories in a polygon in the hyperbolic plane can be coded by the order in which they hit the sides of the polygon. In this paper, we consider the average length of cyclically related closed billiard trajectories in…
Let $P$ be an arbitrary finite partially ordered set. It will be proved that the number of edges of the order polytope ${\mathcal O}(P)$ is equal to that of the chain polytope ${\mathcal C}(P)$. Furthermore, it will be shown that the degree…
The goal of this paper is an analysis of the geometry of billiards in ellipses, based on properties of confocal central conics. The extended sides of the billiards meet at points which are located on confocal ellipses and hyperbolas. They…
We consider the set of polygons all of whose sides are vertical or horizontal with fixed combinatorics (for example all the figure "L"s). We show that there is a dense G $\delta$ subset of such polygons such that for each polygon in this G…
We introduce quantum pin codes: a class of quantum CSS codes. Quantum pin codes are a generalization of quantum color codes and Reed-Muller codes and share a lot of their structure and properties. Pin codes have gauge operators, an…
The classical inner and outer billiards can be formulated in variational terms, with length and area as the respective generating functions. The other two combinations, ``inner with area'' and ``outer with length,'' are more recently…
In network coding a constant dimension code consists of a set of k-dimensional subspaces of F_q^n. Orbit codes are constant dimension codes which are defined as orbits of a subgroup of the general linear group, acting on the set of all…