Complexity and growth for polygonal billiards

Simple item page
dc.creatorCassaigne, J.
dc.creatorHubert, P.
dc.creatorTroubetzkoy, S.
dc.date2001-09-26
dc.date.accessioned2026-07-07T04:43:33Z
dc.date.available2026-07-07T04:43:33Z
dc.descriptionWe establish a relationship between the word complexity and the number of generalized diagonals for a polygonal billiard. We conclude that in the rational case the complexity function has cubic upper and lower bounds. In the tiling case the complexity has cubic asymptotic growth.
dc.description12 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/math/0109208
dc.identifierhttp://arxiv.org/abs/math/0109208
dc.identifierAnnales de l'Institut Fourier 52 (2002) 1001-1013.
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/62268
dc.subjectDynamical Systems
dc.subject37C
dc.titleComplexity and growth for polygonal billiards
dc.typetext

Files

Collections

arXiv