A graph is expelling, sending every billiard loop around the torus non-contractibly, exactly when it is bipartite; ensnaring graphs have a partial structural theory.
Deviations for generalized tiling billiards in cyclic polygons
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
This work continues the study of tiling billiards, a class of dynamical system introduced by Davis et al. in 2018. We develop the study of generalized tiling billiards in a cyclic polygon. This work shows that the behavior of generalized tiling billiards in cyclic N-gons with N > 4 is considerably different from that of triangular and quadrilateral tiling billiards studied before. Indeed, we exhibit an open set of generalized tiling billiard trajectories deviating sublinearly from their asymptotic direction, whereas for N = 3 or 4 almost every trajectory stays at a bounded distance from a line. Moreover, we establish the rate of deviations both in the generic case and in some non generic cases.
citation-role summary
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
ACCEPT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Homology in Combinatorial Refraction Billiards
A graph is expelling, sending every billiard loop around the torus non-contractibly, exactly when it is bipartite; ensnaring graphs have a partial structural theory.