Uniqueness of Billiard Coding in Polygons

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.

arXiv comment25 pages, 14 figures. The proof of main theorem has been revised. Result unchanged

References in corpus (1)

• Code & order in polygonal billiards

Cited by in corpus (1)

• How to hear the shape of a billiard table