Entropy and Complexity of Polygonal Billiards with Spy Mirrors
classification
🧮 math.DS
keywords
complexityentropymirrorspolygonalbilliardbilliardscasescertain
read the original abstract
We prove that a polygonal billiard with one-sided mirrors has zero topological entropy. In certain cases we show sub exponential and for other polynomial estimates on the complexity.
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.