Related papers: Triangular-Grid Billiards and Plabic Graphs
Outer Billiards is a geometrically inspired dynamical system based on a convex shape in the plane. When the shape is a polygon, the system has a combinatorial flavor. In the polygonal case, there is a natural acceleration of the map, a…
It is well-known that billiards in polygons cannot be chaotic (hyperbolic). Particularly Kolmogorov-Sinai entropy of any polygonal billiard is zero. We consider physical polygonal billiards where a moving particle is a hard disc rather than…
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 work we completely describe the dynamics of triangle tiling billiards. In the first part of this work, we propose a geometric approach of dynamics by introducing natural foliations associated to it. In the second part, we exploit…
New invariants in the one-dimensional family of 3-periodic orbits in the elliptic billiard were introduced by the authors in "Can the Elliptic Billiard Still Surprise Us?" (2020), Math. Intelligencer, 42(1): 6--17, some of which were…
We illustrate the theory of one-dimensional pluri-Lagrangian systems with the example of commuting billiard maps in confocal quadrics.
We show that wave functions in planar rational polygonal billiards (all angles rationally related to Pi) can be expanded in a basis of quasi-stationary and spatially regular states. Unlike the energy eigenstates, these states are directly…
A triangular graphenic billiard is defined as a planar carbon polymer in the H\"uckeloid approximation of $\pi-$band electrons. It is shown that the equilateral triangle of arbitrary size and zig-zag edges allows for exact solutions of the…
We introduce symplectic billiards for pairs of possibly non-convex polygons. After establishing basic properties, we give several criteria on pairs of polygons for the symplectic billiard map to be fully periodic, i.e. $\textit{every}$…
We generalize the following simple geometric fact: the only centrally symmetric convex curve of constant width is a circle. Billiard interpretation of the condition of constant width reads: a planar curve has constant width, if and only if,…
A Kempe swap in a proper coloring interchanges the colors on some maximal connected 2-colored subgraph. Two $k$-colorings are $k$-equivalent if we can transform one into the other using Kempe swaps. The triangulated toroidal grid,…
Answering a question of Benjamini & Schramm [8], we show that the Poisson boundary of any planar, uniquely absorbing (e.g. one-ended and transient) graph with bounded degrees can be realised geometrically as a circle, namely as the boundary…
In this article, we study polygonal symplectic billiards. We provide new results, some of which are inspired by numerical investigations. In particular, we present several polygons for which all orbits are periodic. We demonstrate their…
We show that if $n$ is odd and $p \ge C \log n / n$, then with high probability Hamilton cycles in $G(n,p)$ span its cycle space. More generally, we show this holds for a class of graphs satisfying certain natural pseudorandom properties.…
Postnikov's plabic graphs in a disk are used to parametrize totally positive Grassmannians. In recent years plabic graphs have found numerous applications in math and physics. One of the key features of the theory is the fact that if a…
Using the Polya Enumeration Theorem, we count with particular attention to C^3/Gamma up to C^6/Gamma, abelian orbifolds in various dimensions which are invariant under cycles of the permutation group S_D. This produces a collection of…
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…
We prove some partial results on the periodicity of billiard systems on graphs. The results specialize to the case of $n$ billiards with equal mass on the unit interval or circle traveling at the same speed.
In 1984, Erd\H{o}s conjectured that the number of pentagons in any triangle-free graph on $n$ vertices is at most $(n/5)^5$, which is sharp by the balanced blow-up of a pentagon. This was proved by Grzesik, and independently by Hatami,…
We study the deep interplay between geometry of quadrics in d-dimensional space and the dynamics of related integrable billiard systems. Various generalizations of Poncelet theorem are reviewed. The corresponding analytic conditions of…