相关论文: Triangular-Grid Billiards and Plabic Graphs
Gradients of the perimeter and area of a polygon have straightforward geometric interpretations. The use of optimality conditions for constrained problems and basic ideas in triangle geometry show that polygons with prescribed area…
By the Grid Minor Theorem of Robertson and Seymour, every graph of sufficiently large tree-width contains a large grid as a minor. Tree-width may therefore be regarded as a measure of 'grid-likeness' of a graph. The grid contains a long…
The arithmetic triangular billiards are classically chaotic but have Poissonian energy level statistics, in ostensible violation of the BGS conjecture. We show that the length spectra of their periodic orbits divides into subspectra…
A pebbling move on a graph removes two pebbles from a vertex and adds one pebble to an adjacent vertex. A vertex is reachable from a pebble distribution if it is possible to move a pebble to that vertex using pebbling moves. The optimal…
We characterize quantum dynamics in triangular billiards in terms of five properties: (1) the level spacing ratio (LSR), (2) spectral complexity (SC), (3) Lanczos coefficient variance, (4) energy eigenstate localisation in the Krylov basis,…
Two cycles are {\em adjacent} if they have an edge in common. Suppose that $G$ is a planar graph, for any two adjacent cycles $C_{1}$ and $C_{2}$, we have $|C_{1}| + |C_{2}| \geq 11$, in particular, when $|C_{1}| = 5$, $|C_{2}| \geq 7$. We…
We study billiards in domains enclosed by circular polygons. These are closed $C^1$ strictly convex curves formed by finitely many circular arcs. We prove the existence of a set in phase space, corresponding to generic sliding trajectories…
In this paper I will unite two games, symplectic billiards and tiling billiards. The new game is called symplectic tiling billiards. I will prove a result about periodic orbits of symplectic tiling billiards in a very special case and then…
In this paper outer, or dual, billiards outside regular polygons are studied; in particular, periodic points for cases of strictly convex "tables" and for regular n-gons with n = 3,4,6,8,12 are discussed. The main results of the paper are:…
An edge coloring of a simple graph $G$ is said to be \textit{proper rainbow-cycle-forbidding} (PRCF, for short) if no two incident edges receive the same color and for any cycle in $G$, at least two edges of that cycle receive the same…
We use the relation between the volumes of the strata of meromorphic quadratic differentials with at most simple poles on the Riemann sphere and counting functions of the number of (bands of) closed geodesics in associated flat metrics with…
We establish sufficient conditions for the hyperbolicity of the billiard dynamics on surfaces of constant curvature. This extends known results for planar billiards. Using these conditions, we construct large classes of billiard tables with…
The Six Circles Theorem of C. Evelyn, G. Money-Coutts, and J. Tyrrell concerns chains of circles inscribed into a triangle: the first circle is inscribed in the first angle, the second circle is inscribed in the second angle and tangent to…
Random-matrix theory is used to show that the proximity to a superconductor opens a gap in the excitation spectrum of an electron gas confined to a billiard with a chaotic classical dynamics. In contrast, a gapless spectrum is obtained for…
We prove that every $n$ vertex linear triple system with $m$ edges has at least $m^6/n^7$ copies of a pentagon, provided $m>100 \, n^{3/2}$. This provides the first nontrivial bound for a question posed by Jiang and Yepremyan. More…
We conjecture that the balanced complete bipartite graph $K_{\lfloor n/2 \rfloor,\lceil n/2 \rceil}$ contains more cycles than any other $n$-vertex triangle-free graph, and we make some progress toward proving this. We give equivalent…
For an integer $k\geq 1$, a graph is called a $k$-circulant if its automorphism group contains a cyclic semiregular subgroup with $k$ orbits on the vertices. We show that, if $k$ is even, there exist infinitely many cubic arc-transitive…
We use a dynamic programming algorithm to establish a lower bound on the domination number of complete grid graphs of the form $C_n\square P_m$, that is, the Cartesian product of a cycle $C_n$ and a path $P_m$, for $m$ and $n$ sufficiently…
These supplementary materials detail some calculations and some experimental results related to the propagation of light in the photonic billiard. We first justify why we focus only on the rays that are transmitted through the cylinders and…
Astute variations in the geometry of mathematical billiard tables have been and continue to be a source of understanding their wide range of dynamical behaviors, from regular to chaotic. Viewing standard specular billiards in the broader…