Uniqueness of Billiard Coding in Polygons
arXiv:1807.03606
Abstract
We consider polygonal billiards and we show the uniqueness of coding of non-periodic billiard trajectories in polygons whose holes have non-zero minimal diameters, generalising a theorem of Galperin, Krüger and Troubetzkoy.
25 pages, 14 figures. The proof of main theorem has been revised. Result unchanged