Complexity of piecewise convex transformations in two dimensions, with applications to polygonal billiards Eugene Gutkin ∗ and Serge Tabachnikov † November 12, 2018 Abstract ABSTRACT We introduce the class of piecewise convex transfor- mations, and study their complexity. We apply the results to the complexity of polygonal billiards on surfaces of constant curvature. Introduction The following situation frequently occurs in geometric dynamics. There is a phase space X, a transformation T : X → X; and there is a finite de- composition P : X = X(a) ∪ X(b) ∪ ··· . Let A = {a, b, . } be the corresponding alphabet. A phase point x ∈ X is regular if every element of the orbit x, T x, T 2x, . belongs to a unique atom of P. Suppose that arXiv:math/0412335v2 [math.DS] 18 Jan 2005 x ∈ X(a), T x ∈ X(b), etc. The corresponding word a b ··· is the code of x. Let Σ(n) be the set of words in A of length n obtained by coding points in X. The positive function f(n) = |Σ(n)| is the associated complexity. Its ∗UCLA, Math. Dpt., Los Angeles, CA 90095, USA and IMPA, Estrada Dona Castorina 110, 22460-320 Rio de Janeiro RJ, Brasil. E-mail:
[email protected],
[email protected] †Department of Mathematics, Pennsylvania State University, University Park, PA 16802. E-mail:
[email protected] 1 behavior as n →∞1 is an important characteristic of the dynamical system in question. The following examples have motivated our study. Example A. Let P ⊂ R2 be a polygon with sides a, b, . , and let X be the phase space of the billiard map Tb in P .