Results 1  10
of
91
Sums of digits, overlaps, and palindromes
 Discrete Math. & Theoret. Comput. Sci
"... Let ¦¨§�©��� � denote the sum of the digits in the base � representation of �. In a celebrated paper, Thue showed that the infinite word ©� ¦ ¥ ©������������������� � is overlapfree, i.e., contains no subword of the form �������� � , where � is any finite word and � is a single symbol. Let ���� � ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
(Show Context)
Let ¦¨§�©��� � denote the sum of the digits in the base � representation of �. In a celebrated paper, Thue showed that the infinite word ©� ¦ ¥ ©������������������� � is overlapfree, i.e., contains no subword of the form �������� � , where � is any finite word and � is a single symbol. Let ���� � be integers with ���� � , ���� �. In this paper, generalizing Thue’s result, we prove that the infinite word �¨§� � �� � ��©�¦¨§�©������������� � ���� � is overlapfree if and only if ���� �. We also prove that ��§¨ � � contains arbitrarily long squares (i.e., subwords of the form �� � where � is nonempty), and contains arbitrarily long palindromes if and only if ���� �.
Doppler resilient Golay complementary pairs for radar,” presented at the
 IEEE Statist. Signal Process. Workshop (SSP
, 2007
"... We present a systematic way of constructing a Doppler resilient sequence of Golay complementary waveforms for radar, for which the composite ambiguity function maintains ideal shape at small Doppler shifts. The idea is to determine a sequence of Golay pairs that annihilates the loworder terms of th ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
(Show Context)
We present a systematic way of constructing a Doppler resilient sequence of Golay complementary waveforms for radar, for which the composite ambiguity function maintains ideal shape at small Doppler shifts. The idea is to determine a sequence of Golay pairs that annihilates the loworder terms of the Taylor expansion of the composite ambiguity function. The ProuhetThueMorse sequence plays a key role in the construction of Doppler resilient sequences of Golay pairs. We extend this construction to multiple dimensions. In particular, we consider radar polarimetry, where the dimensions are realized by two orthogonal polarizations. We determine a sequence of twobytwo Alamouti matrices, where the entries involve Golay pairs and for which the matrixvalued composite ambiguity function vanishes at small Doppler shifts. 1.
THE SINGULAR CONTINUOUS DIFFRACTION MEASURE OF THE THUEMORSE CHAIN
, 809
"... Abstract. The paradigm for singular continuous spectra in symbolic dynamics and in mathematical diffraction is provided by the ThueMorse chain, in its realisation as a binary sequence with values in {±1}. We revisit this example and derive a functional equation together with an explicit form of the ..."
Abstract

Cited by 14 (12 self)
 Add to MetaCart
(Show Context)
Abstract. The paradigm for singular continuous spectra in symbolic dynamics and in mathematical diffraction is provided by the ThueMorse chain, in its realisation as a binary sequence with values in {±1}. We revisit this example and derive a functional equation together with an explicit form of the corresponding singular continuous diffraction measure, which is related to the known representation as a Riesz product. The ThueMorse chain can be defined via the primitive substitution rule
The origins of combinatorics on words
, 2007
"... We investigate the historical roots of the field of combinatorics on words. They comprise applications and interpretations in algebra, geometry and combinatorial enumeration. These considerations gave rise to early results such as those of Axel Thue at the beginning of the 20th century. Other early ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
(Show Context)
We investigate the historical roots of the field of combinatorics on words. They comprise applications and interpretations in algebra, geometry and combinatorial enumeration. These considerations gave rise to early results such as those of Axel Thue at the beginning of the 20th century. Other early results were obtained as a byproduct of investigations on various combinatorial objects. For example, paths in graphs are encoded by words in a natural way, and conversely, the Cayley graph of a group or a semigroup encodes words by paths. We give in this text an account of this twosided interaction.
A Unique Decomposition Theorem for Factorial Languages
 Internat. J. Algebra Comput
"... We study decompositions of a factorial language to catenations of factorial languages and introduce the notion of a canonical decomposition. ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
(Show Context)
We study decompositions of a factorial language to catenations of factorial languages and introduce the notion of a canonical decomposition.
A short proof of the transcendence of the Thue– Morse continued fraction
"... The ThueMorse sequence t = (tn)n≥0 on the alphabet {a, b} is defined as follows: tn = a (respectively, tn = b) if the sum of binary digits of n is even (respectively, odd). This famous binary sequence was first introduced by A. Thue [12] in 1912. It was considered nine years later by M. Morse [7] i ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
(Show Context)
The ThueMorse sequence t = (tn)n≥0 on the alphabet {a, b} is defined as follows: tn = a (respectively, tn = b) if the sum of binary digits of n is even (respectively, odd). This famous binary sequence was first introduced by A. Thue [12] in 1912. It was considered nine years later by M. Morse [7] in a totally different context. These pioneering papers have led to a number of investigations and a broad literature devoted to t. There are many other ways to define the ThueMorse sequence. Each of them gives rise to specific interests, problems, and most of the time solutions. Such ubiquity is well described in the survey [1], where the occurrence of t in combinatorics, number theory, differential geometry, theoretical computer science, physics, and even chess is documented. For a and b distinct integers K. Mahler [6] (see also [2]) established that the sum of the series ∑ −n n≥0 tn2 is transcendental. The present note adresses another Diophantine result related to the ThueMorse sequence. It is widely believed that the continued fraction expansion of every irrational algebraic number α either is eventually periodic (and we know from Lagange’s theorem that this is the case if and only if α is a quadratic irrational) or contains arbitrarily large partial quotients. Apparently, this challenging question was first considered by A. Ya. Khintchin in [4] (see also [5], [11], or [13] for surveys or books including discussions of this subject). A preliminary step towards its resolution consists in providing explicit examples of transcendental continued fractions with bounded partial quotients. In this direction, M. Queffélec [8] showed in 1998 that the ThueMorse continued fractions are transcendental. Theorem 1 (Queffélec). If a and b are distinct positive integers and t = (tn)n≥0 is the ThueMorse sequence on the alphabet {a, b}, then the number is transcendental. 1 ξ = [t0, t1, t2,...] = t0 +
Arithmetical Complexity of Infinite Words
"... We introduce a new notion of the arithmetical complexity of a word, that is the number of words of a given length which occur in it in arithmetical progressions. The arithmetical complexity is related to a wellknown function of subword complexity and cannot be less than it. However, our main result ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
We introduce a new notion of the arithmetical complexity of a word, that is the number of words of a given length which occur in it in arithmetical progressions. The arithmetical complexity is related to a wellknown function of subword complexity and cannot be less than it. However, our main results show that the behavour of the arithmetical complexity is not determined only by the subword complexity growth: if the latter grows linearly, the arithmetical complexity can increase both linearly and exponentially. To prove it, we consider a family of D0L words with high arithmetical complexity and a family of Toeplitz words with low one. In particular, we nd the arithmetical complexity of the ThueMorse word and of the paperfolding word. 1
Periodicity, Repetitions, and Orbits of an Automatic Sequence
, 2009
"... We revisit a technique of S. Lehr on automata and use it to prove old and new results in a simple way. We give a very simple proof of the 1986 theorem of Honkala that it is decidable whether a given kautomatic sequence is ultimately periodic. We prove that it is decidable whether a given kautomati ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
(Show Context)
We revisit a technique of S. Lehr on automata and use it to prove old and new results in a simple way. We give a very simple proof of the 1986 theorem of Honkala that it is decidable whether a given kautomatic sequence is ultimately periodic. We prove that it is decidable whether a given kautomatic sequence is overlapfree (or squarefree, or cubefree, etc.) We prove that the lexicographically least sequence in the orbit closure of a kautomatic sequence is kautomatic, and use this last result to show that several related quantities, such as the critical exponent, irrationality measure, and recurrence quotient for Sturmian words with slope α, have automatic continued fraction expansions if α does.