Results 1  10
of
61
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 13 (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.
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 (2 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.
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 10 (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 ���� �.
PERIODIC UNIQUE BETAEXPANSIONS: THE SHARKOVSKIĬ ORDERING
"... ABSTRACT. Let β ∈ (1, 2). Each x ∈ [0, β−1] can be represented in the form x = εkβ −k, k=1 where εk ∈ {0, 1} for all k (a βexpansion of x). If β> 1+√5 2, then, as is well known, there 1 always exist x ∈ (0, β−1) which have a unique βexpansion. In the present paper we study (purely) periodic uni ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
(Show Context)
ABSTRACT. Let β ∈ (1, 2). Each x ∈ [0, β−1] can be represented in the form x = εkβ −k, k=1 where εk ∈ {0, 1} for all k (a βexpansion of x). If β> 1+√5 2, then, as is well known, there 1 always exist x ∈ (0, β−1) which have a unique βexpansion. In the present paper we study (purely) periodic unique βexpansions and show that for each n ≥ 2 there exists βn ∈ [ 1+ √ 5 2, 2) such that there are no unique periodic βexpansions of smallest period n for β ≤ βn and at least one such expansion for β> βn. Furthermore, we prove that βk < βm if and only if k is less than m in the sense of the Sharkovskiĭ ordering. We give two proofs of this result, one of which is independent, and the other one links it to the dynamics of a family of trapezoidal maps. 1. HISTORY OF THE PROBLEM AND FORMULATION OF RESULTS This paper continues the line of research related to the combinatorics of representations of real numbers in noninteger bases ([12, 13, 15, 21]). 1 Let β ∈ (1, 2) be our parameter and let x ∈ Iβ: = [0,]. Then x has at least one represenβ−1 tation of the form (1.1) x = πβ(ε1, ε2,...): = εkβ −k, εk ∈ {0, 1}, k=1 (use, e.g., the greedy algorithm) which we call a βexpansion of x and write x ∼ (ε1, ε2,...)β. Let us recall some key results regarding βexpansions. Firstly, if 1 < β < G: = 1+√5, then 2 each x ∈ � � 1 0, has a continuum of βexpansions [12]. On the other hand, for any β> G, β−1 there exist infinitely many x which have a unique βexpansion (see [9, 13]), although almost all x ∈ Iβ still have a continuum of βexpansions [21]. More specifically, put x ∼ (010101...)β = 1 β2. Then both x and βx have a unique β
Behavioural Differential Equations and Coinduction for Binary Trees
"... Abstract. We study the set TA of infinite binary trees with nodes labelledinasemiringA from a coalgebraic perspective. We present coinductive definition and proof principles based on the fact that TA carries a final coalgebra structure. By viewing trees as formal power series, we develop a calculus ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
(Show Context)
Abstract. We study the set TA of infinite binary trees with nodes labelledinasemiringA from a coalgebraic perspective. We present coinductive definition and proof principles based on the fact that TA carries a final coalgebra structure. By viewing trees as formal power series, we develop a calculus where definitions are presented as behavioural differential equations. We present a general format for these equations that guarantees the existence and uniqueness of solutions. Although technically not very difficult, the resulting framework has surprisingly nice applications, which is illustrated by various concrete examples. 1
Squarefree partial words
, 2008
"... We say that a partial word w over an alphabet A is squarefree if every factor xx ′ of w such that x and x ′ are compatible is either of the form ⋄a or a ⋄ where ⋄ is a hole and a ∈ A. We prove that there exist uncountably many squarefree partial words over a ternary alphabet with an infinite numbe ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
We say that a partial word w over an alphabet A is squarefree if every factor xx ′ of w such that x and x ′ are compatible is either of the form ⋄a or a ⋄ where ⋄ is a hole and a ∈ A. We prove that there exist uncountably many squarefree partial words over a ternary alphabet with an infinite number of holes.
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 5 (2 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
OverlapFree Symmetric D0L words
, 2001
"... Introduction In his classical 1912 paper [15] (see also [3]), A. Thue gave the first example of an overlapfree infinite word, i. e., of a word which contains no subword of the form axaxa for any symbol a and word x. Thue's example is known now as the ThueMorse word w TM = 0110100110010110100 ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
Introduction In his classical 1912 paper [15] (see also [3]), A. Thue gave the first example of an overlapfree infinite word, i. e., of a word which contains no subword of the form axaxa for any symbol a and word x. Thue's example is known now as the ThueMorse word w TM = 01101001100101101001011001101001 : : :: It was rediscovered several times, can be constructed in many alternative ways and occurs in various fields of mathematics (see the survey [1]). The set of all overlapfree words was studied e. g. by Fife [8] who described all binary overlapfree infinite words and Seebold [13] who proved that the ThueMorse word is essentially the only binary overlapfree word which is a fixed point of a morphism. Nowadays the theory of overlapfree words is a part of a more general theory of pattern avoidance [5]. J.P. Allouche and J. Shallit [2] asked if the initial Thue's construction of an overlapfree wo
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 4 (3 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
ON UNIVOQUE PISOT NUMBERS
, 2007
"... We study Pisot numbers β ∈ (1, 2) which are univoque, i.e., such that there exists only one representation of 1 as 1 = ∑ n≥1 snβ−n, with sn ∈ {0, 1}. We prove in particular that there exists a smallest univoque Pisot number, which has degree 14. Furthermore we give the smallest limit point of the s ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
We study Pisot numbers β ∈ (1, 2) which are univoque, i.e., such that there exists only one representation of 1 as 1 = ∑ n≥1 snβ−n, with sn ∈ {0, 1}. We prove in particular that there exists a smallest univoque Pisot number, which has degree 14. Furthermore we give the smallest limit point of the set of univoque Pisot numbers.