2018
DOI: 10.1017/etds.2017.130
|View full text |Cite
|
Sign up to set email alerts
|

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Abstract: A set R ⊂ N is called rational if it is well-approximable by finite unions of arithmetic progressions, meaning that for every ǫ > 0 there exists a set B = r i=1 a i N+b i , where a 1 , . . . , a r , b 1 , . . . , b r ∈ N, such thatExamples of rational sets include many classical sets of number-theoretical origin such as the set of squarefree numbers, the set of abundant numbers, or sets of the form Φ x := {n ∈ N :< x}, where x ∈ [0, 1] and ϕ is Euler's totient function. We investigate the combinatorial and dyn… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
43
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 16 publications
(43 citation statements)
references
References 57 publications
0
43
0
Order By: Relevance
“…69 While in [53,60] Möbius disjointness is proved for the dynamical systems given by bijective substitutions, [48] treats the opposite case, so called synchronized. As noted in [21], this leads to dynamical systems given by rational sequences and such are Möbius disjoint. Note also that for the synchronized case, once the system is uniquely ergodic, it is automatically a uniquely ergodic model of an automorphism with discrete spectrum, cf.…”
Section: Substitutionsmentioning
confidence: 87%
See 3 more Smart Citations
“…69 While in [53,60] Möbius disjointness is proved for the dynamical systems given by bijective substitutions, [48] treats the opposite case, so called synchronized. As noted in [21], this leads to dynamical systems given by rational sequences and such are Möbius disjoint. Note also that for the synchronized case, once the system is uniquely ergodic, it is automatically a uniquely ergodic model of an automorphism with discrete spectrum, cf.…”
Section: Substitutionsmentioning
confidence: 87%
“…For general B-free sets the situation is more complicated and we have the following result: This can be generalized to B that are not Besicovitch by considering divisibility and recurrence along a certain subsequence pN k q kě1 . As a combinatorial application, one obtains in [21] the following result: Suppose that pN k q kě1 is such that the density of F B along pN k q kě1 exists and is positive. Then there exists D Ă F B which equals F B up to a set of zero density along pN k q kě1 such that for all r P D and for all E Ă N with positive upper density, for any polynomials p i P Qrts, i " 1, .…”
Section: Ergodic Ramsey Theorymentioning
confidence: 99%
See 2 more Smart Citations
“…(2) χ(n) = 0 whenever gcd(d, n) > 1, and χ(n) is a ϕ(d)-th root of unity whenever gcd(d, n) = 1, where ϕ denotes Euler's totient function; (3) χ(nm) = χ(n)χ(m) for all n, m ∈ N. Any Dirichlet character is periodic and completely multiplicative. 3 We also remark that χ : N → C is a Dirichlet character of modulus k if and only if there exists a group character χ of the multiplicative group (Z/kZ) * such that χ(n) = χ(n mod k) for all n ∈ N. The Dirichlet character determined by the trivial (constant equal to 1) character of (Z/kZ) * is called the principal character of modulus k. It is denoted by χ 1 . Note that if d|k and χ is a Dirichlet character of modulus d then…”
Section: Multiplicative Functionsmentioning
confidence: 99%