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

A spectral refinement of the Bergelson–Host–Kra decomposition and new multiple ergodic theorems

Abstract: We investigate how spectral properties of a measure preserving system (X, B, µ, T ) are reflected in the multiple ergodic averages arising from that system. For certain sequences a : N → N we provide natural conditions on the spectrum σ(T ) such that for all f 1 , .In particular, our results apply to infinite arithmetic progressions a(n) = qn+r, Beatty sequences a(n) = ⌊θn+γ⌋, the sequence of squarefree numbers a(n) = q n , and the sequence of prime numbers a(n) = p n .We also obtain a new refinement of Szemer… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
17
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 12 publications
(17 citation statements)
references
References 38 publications
0
17
0
Order By: Relevance
“…For example, Bergelson, Host and Kra [6] analyze this component to prove a generalization of Khintchine's theorem. Moreira and Richter [29] show that this component arises from a system whose spectrum is contained in the spectrum of the original system.…”
Section: Introductionmentioning
confidence: 99%
“…For example, Bergelson, Host and Kra [6] analyze this component to prove a generalization of Khintchine's theorem. Moreira and Richter [29] show that this component arises from a system whose spectrum is contained in the spectrum of the original system.…”
Section: Introductionmentioning
confidence: 99%
“…If in (5) one replaces the optimal lower bound µ(A) k+1 − with 0, then the set is syndetic for any k ∈ N. This was proved in [19] for k = 2 and k = 3, and for larger k, this is essentially the content of [8, Corollary 6.5]; see also [26]. Theorems 1.2, 1.3 and 1.4 will be proved in Section 3.…”
Section: 2mentioning
confidence: 92%
“…In order to show that A = B = 0, we first show that B is a positive scalar multiple of A. Once we do that, we have from (27) that B = v 1 v 4 v 2 v 3 A and hence, equality between the first and last quantities from (26)…”
mentioning
confidence: 99%
“…where π(N) denotes the number of primes less than or equal to N. See [7,14,35] for more information.…”
Section: Density Problemsmentioning
confidence: 99%