On additive properties of sets defined by the Thue-Morse word
نویسندگان
چکیده
In this paper we study some additive properties of subsets of N : A subset A of N is called ksummable (k a positive integer) if A contains {n∈F xn |F ⊆ {0, . . . , k − 1}} for some k-term sequence of natural numbers x0 < x1 < x2 < · · · < xk−1. We say A ⊆ N is FS big if A is k-summable for each positive integer k. We say is A ⊆ N is infinite FS big if for each positive integer k, A contains {n∈F xn |F ⊂ N ; #F ≤ k} for some infinite sequence of natural numbers x0 < x1 < x2 < · · · . We say A ⊂ N is an IP-set if A contains { ∑ n∈F xn |F ⊂ N ; #F < ∞} for some infinite sequence of natural numbers x0 < x1 < x2 < · · · . By a celebrated result of N. Hindman [3], the property of being an IP-set is partition regular, i.e., if A is an IP-set then for any finite partition of A, one cell of the partition is an IP-set. Recently the authors proved that the property of being FS-big is also partition regular. Let T = 011010011001011010 . . . denote the Thue-Morse word fixed by the morphism 0 7→ 01 and 1 7→ 10. For each factor u of T we consider the set T ∣∣ u ⊆ N of all occurrences of u in T. In this note we characterize the sets T∣∣ u in terms of the additive properties defined above. As a consequence we show that the property of being infinite FS-big is not partition regular.
منابع مشابه
Acoustic Wave propagation through multilayer Thue-Morse structures containing two, three and four materials of Cu, Al, MgO and Pb
In this paper, the acoustic wave propagation in multilayer Thue-Morse structures has theoretically been studied. The composing layers were assumed do be Cu, Al, Mgo and Pb materials. Two, three or four different materials have been used in a typical structure. By using a perpendicular incident acoustic wave, the transmission coefficient was calculated and then by its old, the frequency gaps was...
متن کاملOn the structure of compacted subword graphs of Thue-Morse words and their applications
We investigate how syntactic properties of Thue-Morse words are related to special type of automata/graphs. The directed acyclic subword graph (dawg, in short) is a useful deterministic automaton accepting all su xes of the word. Its compacted version (resulted by compressing chains of states) is denoted by cdawg. The cdawgs of Thue-Morse words have regular and very simple structure, in particu...
متن کاملNon-repetitive complexity of infinite words
The non-repetitive complexity function of an infinite word x (first defined by Moothathu) is the function of n that counts the number of distinct factors of length n that appear at the beginning of x prior to the first repetition of a length-n factor. We examine general properties of the non-repetitive complexity function, as well as obtain formulas for the non-repetitive complexity of the Thue...
متن کاملOn the 2-abelian complexity of the Thue-Morse word
We show that the 2-abelian complexity of the infinite Thue–Morse word is 2-regular, and other properties of the 2-abelian complexity, most notably that it is a concatenation of palindromes of increasing length. We also show sharp bounds for the length of unique extensions of factors of size n, occurring in the Thue–Morse word.
متن کاملSmooth words over arbitrary alphabets
Smooth infinite words over Σ = {1, 2} are connected to the Kolakoski word K = 221121 · · ·, defined as the fixpoint of the function ∆ that counts the length of the runs of 1’s and 2’s. In this paper we extend the notion of smooth words to arbitrary alphabets and study some of their combinatorial properties. Using the run-length encoding ∆, every word is represented by a word obtained from the i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 120 شماره
صفحات -
تاریخ انتشار 2013