COMPLEXITY LOWER BOUNDS FOR POLYGONAL BILLIARDS

Authors
TROUBETZKOY S
Citation
S. Troubetzkoy, COMPLEXITY LOWER BOUNDS FOR POLYGONAL BILLIARDS, Chaos, 8(1), 1998, pp. 242-244
Citations number
12
Categorie Soggetti
Mathematics,"Physycs, Mathematical",Mathematics
Journal title
Chaos → ACNP
ISSN journal
10541500
Volume
8
Issue
1
Year of publication
1998
Pages
242 - 244
Database
ISI
SICI code
1054-1500(1998)8:1<242:CLBFPB>2.0.ZU;2-R
Abstract
Polygonal billiards have zero topological entropy. Complexity is a fin er measure of their asymptotic behavior. In this article we show an ex plicit quadratic lower bound for the complexity of the billiard in an arbitrary polygon. (C) 1998 American Institute of Physics.