English
Related papers

Related papers: Triangular-Grid Billiards and Plabic Graphs

200 papers

The circumcircle of a planar convex polygon P is a circle C that passes through all vertices of P. If such a C exists, then P is said to be cyclic. Fix C to have unit radius. While any two angles of a uniform cyclic triangle are negatively…

History and Overview · Mathematics 2016-10-04 Steven Finch

We identify a collection of periodic billiard orbits in a self-similar Sierpinski carpet billiard table. Based on a refinement of the result of Durand-Cartagena and Tyson regarding nontrivial line segments in a self-similar Sierpinski…

Dynamical Systems · Mathematics 2016-08-30 Joe P. Chen , Robert G. Niemeyer

For all $n\ge 9$, we show that the only triangle-free graphs on $n$ vertices maximizing the number $5$-cycles are balanced blow-ups of a 5-cycle. This completely resolves a conjecture by Erd\H{o}s, and extends results by Grzesik and Hatami,…

Combinatorics · Mathematics 2020-06-12 Bernard Lidický , Florian Pfender

We study a class of planar billiards having the remarkable property that their phase space consists up to a set of zero measure of two invariant sets formed by orbits moving in opposite directions. The tables of these billiards are tubular…

Dynamical Systems · Mathematics 2009-11-13 Leonid A. Bunimovich , Gianluigi Del Magno

Let $S_{\rm div}(n)$ denote the set of permutations $\pi$ of $n$ such that for each $1\leq j \leq n$ either $j \mid \pi(j)$ or $\pi(j) \mid j$. These permutations can also be viewed as vertex-disjoint directed cycle covers of the divisor…

Number Theory · Mathematics 2022-09-29 Nathan McNew

The Berge-Fulkerson conjecture states that every bridgeless cubic graph can be covered with six perfect matchings such that each edge is covered exactly twice. An equivalent reformulation is that it's possible to find a 6-cycle 4-cover. In…

Combinatorics · Mathematics 2026-03-25 Nikolay Ulyanov

Let $G$ be a graph. A total dominating set in a graph $G$ is a set $S$ of vertices of $G$ such that every vertex in $G$ is adjacent to a vertex in $S$. Recently, the following question was proposed: "Is it true that every connected cubic…

Combinatorics · Mathematics 2023-08-30 S. Akbari , M. Azimian , A. Fazli Khani , B. Samimi , E. Zahiri

We present a solution of the algebraic version of Birkhoff Conjecture on integrable billiards. Namely we show that every polynomially integrable real bounded convex planar billiard with smooth boundary is an ellipse. We extend this result…

Dynamical Systems · Mathematics 2019-02-25 Alexey Glutsyuk

In this paper, a complete classification of finite simple cubic vertex-transitive graphs of girth $6$ is obtained. It is proved that every such graph, with the exception of the Desargues graph on $20$ vertices, is either a skeleton of a…

Combinatorics · Mathematics 2025-01-06 Primož Potočnik , Janoš Vidali

We consider packings of congruent circles on a square flat torus, i.e., periodic (w.r.t. a square lattice) planar circle packings, with the maximal circle radius. This problem is interesting due to a practical reason - the problem of "super…

Metric Geometry · Mathematics 2016-07-21 Oleg R. Musin , Anton V. Nikitenko

Conway and Lagarias showed that certain roughly triangular regions in the hexagonal grid cannot be tiled by shapes Thurston later dubbed tribones. Here we study a two-parameter family of roughly hexagonal regions in the hexagonal grid and…

Combinatorics · Mathematics 2023-07-10 Jesse Kim , James Propp

The complexity of the billiard language of regular polygons in the hyperbolic plane with $p$ sides and $2\pi/q$ internal angles is known to grow exponentially and the exponential growth rate is known to equal the topological entropy of the…

Dynamical Systems · Mathematics 2026-05-15 Sunrose T. Shrestha , Jane Wang

In this work, we perform a statistical study on Dirac Billiards in the extreme quantum limit (a single open channel on the leads). Our numerical analysis uses a large ensemble of random matrices and demonstrates the preponderant role of…

Mesoscale and Nanoscale Physics · Physics 2016-09-22 A. J. Nascimento Júnior , M. S. M. Barros , J. G. G. S. Ramos , A. L. R. Barbosa

In our recent paper, we studied periodic billiard trajectories in the regular pentagon and closed geodesic on the double pentagon, a translation surface of genus two. In particular, we made a number of conjectures concerning symbolic…

Dynamical Systems · Mathematics 2012-01-04 Dmitry Fuchs , Serge Tabachnikov

The 1d family of Poncelet polygons interscribed between two circles is known as the Bicentric family. Using elliptic functions and Liouville's theorem, we show (i) that this family has invariant sum of internal angle cosines and (ii) that…

Dynamical Systems · Mathematics 2021-08-31 Pedro Roitman , Ronaldo Garcia , Dan Reznik

Polygonal billiards are an example of pseudo-chaotic dynamics, a combination of integrable evolution and sudden jumps due to conical singular points that arise from the corners of the polygons. Such pseudo-chaotic behaviour, often…

Statistical Mechanics · Physics 2021-08-11 Jordan Orchard , Lamberto Rondoni , Carlos Mejia-Monasterio , Federico Frascoli

We study polygonal billiards with reflection laws contracting the reflected angle towards the normal. It is shown that if a polygon does not have parallel sides facing each other, then the corresponding billiard map has finitely many…

Dynamical Systems · Mathematics 2015-07-23 Gianluigi Del Magno , João Lopes Dias , Pedro Duarte , José Pedro Gaivão

This paper is concerned with the Lyapunov spectrum for measurable cocycles over an ergodic pmp system taking values in semi-simple real Lie groups. We prove simplicity of the Lyapunov spectrum and its continuity under certain perturbations…

Dynamical Systems · Mathematics 2025-04-15 Uri Bader , Alex Furman

Since first introduced by Sudakov and Vu in 2008, the study of resilience problems in random graphs received a lot of attention in probabilistic combinatorics. Of particular interest are resilience problems of spanning structures. It is…

Combinatorics · Mathematics 2021-11-18 Manuela Fischer , Nemanja Škorić , Angelika Steger , Miloš Trujić

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…

Dynamical Systems · Mathematics 2007-05-23 J. Cassaigne , P. Hubert , S. Troubetzkoy