Complexity lower bounds for polygonal billiards
Serge Troubetzkoy · Chaos An Interdisciplinary Journal of Nonlinear Science · 1998
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
Chaos An Interdisciplinary Journal of Nonlinear Science · American Institute of Physics · article · 1998
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.
Open the resolved locator · 10.1063/1.166301
Metadata licence: OpenAlex metadata (CC0)