Code & order in polygonal billiards
classification
🧮 math.DS
keywords
codeequivalentorbitspartialpolygonsrespsamesimilar
read the original abstract
Two polygons $P,Q$ are code equivalent if there are billiard orbits $u,v$ which hit the same sequence of sides and such that the projections of the orbits are dense in the boundaries $\partial P, \partial Q$. Our main results show when code equivalent polygons have the same angles, resp. are similar, resp. affinely similar.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.