Sturmin序列的算术子列的复杂度.pdfVIP

() Sturmian Sturmian Sturmian Christoffel Beatty Sturmian Sturmian (Sturmian ) Sturmian Sturmain Sturmian , , I Abstract Symbolical dynamical systems prove to be very useful in many mathematical fields (such as number theory, harmonic analysis, combinatorics, ergodic theory and so on), as well as in theoretical computer science and physics. Sturmian sequences play an important role in the study of symbolic dynamical systems, and were studied extensively by many authors. By definition, Sturmian sequences are those with complexity ; in other words, they are the sequences with minimal complexity amongst all aperiodic ones. There are many equivalent definitions of Sturmian sequences under different names such as rotation sequences, cutting sequences, Christoffel words, Beatty sequences, characteristic sequences, balanced sequences, Sturmian sequences, and so on. In this thesis, we study the arithmetic subsequences of the Sturmian sequences. Using the geometric representations, we determine the complexity of these subsequence. In par- ticular, we show that their complexity functions have differences in the set , and are eventually (so, the subsequence is not Stumian). The thesis is organized as follows: After an introductory chapter (Chap. 1), we present some basic properties and many equivalent definitions of Sturmian sequence in Chapter 2. In the last one, we determine the complexity of the arithmetical subsequences of Sturmian sequences. Keywords: Sturmian sequence, Compelxity, Arithmetic SubSequence