2009
DOI: 10.4064/aa136-4-2
|View full text |Cite
|
Sign up to set email alerts
|

Univoque numbers and an avatar of Thue–Morse

Abstract: Univoque numbers are real numbers λ > 1 such that the number 1 admits a unique expansion in base λ, i.e., a unique expansion 1 = j≥0 a j λ −(j+1) , with a j ∈ {0, 1, . . . , ⌈λ⌉ − 1} for every j ≥ 0. A variation of this definition was studied in 2002 by Komornik and Loreti, together with sequences called admissible sequences. We show how a 1983 study of the first author gives both a result of Komornik and Loreti on the smallest admissible sequence on the set {0, 1, . . . , b}, and a result of de Vries and Komo… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2009
2009
2023
2023

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 10 publications
(11 citation statements)
references
References 14 publications
0
11
0
Order By: Relevance
“…Then t 1 ≥ ⌈(N − 1)/2⌉. By Definition 2.1 of an admissible block one can directly verify that (t 1 · · · t p ) ∞ ≥ (t 1 t 1 ) ∞ (see also [3,Proposition 2]). Note by (2)…”
Section: Proof Of Theorem 23mentioning
confidence: 97%
“…Then t 1 ≥ ⌈(N − 1)/2⌉. By Definition 2.1 of an admissible block one can directly verify that (t 1 · · · t p ) ∞ ≥ (t 1 t 1 ) ∞ (see also [3,Proposition 2]). Note by (2)…”
Section: Proof Of Theorem 23mentioning
confidence: 97%
“…have the same length β ℓ+1 and all gaps (called (ℓ+1)-level gaps) between them have the same length 1]) and the right endpoint of φ J(N −1) ([0, 1]) coincides with the right endpoint of φ J ([0, 1]). The requirement β ∈ (1/(2N − 1), 1/N ) implies the following simple properties:…”
Section: Geometrical Description Ofmentioning
confidence: 99%
“…For a more general digit set Ω, there also exist some results on the smallest admissible sequence which is related to the Thue-Morse sequence (cf. [1]).…”
Section: Proposition 43 (Komornik and Loretimentioning
confidence: 99%
See 1 more Smart Citation
“…The main result of this paper is the computation of the factor and palindromic complexity of two infinite words which appear in [1] as a representation of some significant univoque numbers. A real number λ > 1 is said to be univoque if 1 admits a unique expansion in base λ of the form 1 = i>0 a i λ −i with a i ∈ {0, 1, .…”
Section: Introductionmentioning
confidence: 99%