Complexity of Trajectories in Rectangular Billiards
  Revised version: some minor errors and typos fixed; exposition watered. Abstract: To a trajectory of a billiard in parallelogram we assign its symbolic trajectory - the sequence of numbers of coordinate plane, to which the faces met by the trajectory are parallel. The complexity of the trajectory is the number of different words of length $n$ occurring in it. We prove that for generic trajectories the complexity is well defined and calculate it, confirming the conjecture of Arnoux, Mauduit, Shiokawa and Tamura [AMST]. 
Yuliy Baryshnikov