2010
DOI: 10.1017/s0143385710000258
|View full text |Cite
|
Sign up to set email alerts
|

Multiple recurrence for two commuting transformations

Abstract: This paper is devoted to a study of the multiple recurrence of two commuting transformations. We derive a result which is similar but not identical to that of one single transformation established by Bergelson, Host and Kra. We will use the machinery of "magic systems" established recently by B. Host for the proof.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
63
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 43 publications
(64 citation statements)
references
References 15 publications
1
63
0
Order By: Relevance
“…Since by hypothesis E µ (f |Z k−1 ) = 0, by (10) we have |||f ||| k,µ = 0, and as a consequence |||f ||| k,µx = 0 for µ-almost every x ∈ X by (9). This completes the proof.…”
Section: 1mentioning
confidence: 90%
See 3 more Smart Citations
“…Since by hypothesis E µ (f |Z k−1 ) = 0, by (10) we have |||f ||| k,µ = 0, and as a consequence |||f ||| k,µx = 0 for µ-almost every x ∈ X by (9). This completes the proof.…”
Section: 1mentioning
confidence: 90%
“…Since E(f −f|Z k−1 ) = 0, by (10) we have |||f −f||| k = 0, and by inequality (7), all these integrals are equal to zero. This establishes that g · D k f dµ is equal to g · D kf dµ, and the announced result follows.…”
Section: Proof We Show (I) the Averagesmentioning
confidence: 94%
See 2 more Smart Citations
“…. , n ) without ergodicity assumptions [CFH11] and the family (n, n) if T 1 and T 2 are jointly ergodic [Chu11], although in the latter case the optimal bound is µ(A) 4 and not µ(A) 3 as one would expect from the weakly mixing case.…”
Section: Introductionmentioning
confidence: 99%