title: Complexity lower bounds for polygonal billiards.
abstract: Polygonal billiards have zero topological entropy. Complexity is a finer measure of their asymptotic behavior. In this article we show an explicit quadratic lower bound for the complexity of the billiard in an arbitrary polygon. (c) 1998 American Institute of Physics.
authors.affiliation: Department of Mathematics, University of Alabama at Birmingham, Birmingham, Alabama 35294.
authors.forename: S.
authors.initials: S
authors.lastname: Troubetzkoy