Complexity of Trajectories in Rectangular Billiards

Details Complexity of Trajectories in Rectangular Billiards Complexity of Trajectories in Rectangular Billiards

1994-06-09

arxiv.org/abs/chao-dyn/9406001v2

Nonlinear Sciences

Chaotic Dynamics

AMSTeX file, 13 pages

Scientific paper

10.1007/BF02099463

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].

Affiliated with

Also associated with

No associations

Rating

Complexity of Trajectories in Rectangular Billiards does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Complexity of Trajectories in Rectangular Billiards, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity of Trajectories in Rectangular Billiards will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-663591