1998
DOI: 10.1017/s0143385798108349
|View full text |Cite
|
Sign up to set email alerts
|

Oscillation in ergodic theory

Abstract: In this paper we establish a variety of square function inequalities and study other operators which measure the oscillation of a sequence of ergodic averages. These results imply the pointwise ergodic theorem and give additional information such as control of the number of upcrossings of the ergodic averages. Related results for differentiation and for the connection between differentiation operators and the dyadic martingale are also established.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

5
187
0
1

Year Published

2006
2006
2021
2021

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 178 publications
(193 citation statements)
references
References 14 publications
5
187
0
1
Order By: Relevance
“…The following result was already obtained for p ≥ 2 and d = 1 in [9], and for d > 1 in [10]. Here is a simple proof for 1 < p < ∞ and d ≥ 1.…”
Section: Proof If We Letsupporting
confidence: 57%
“…The following result was already obtained for p ≥ 2 and d = 1 in [9], and for d > 1 in [10]. Here is a simple proof for 1 < p < ∞ and d ≥ 1.…”
Section: Proof If We Letsupporting
confidence: 57%
“…Simple proofs (based on jump inequalities) have been obtained in [1] and [27] (see also [9], [15] for other expositions). Inequality (40) has been extended to various families of convolution operators ( [1], [14], [2], [15]). Let ψ be a Schwartz function on R with ψ = 1, for each k let ψ k = 2 −k ψ(2 −k ·) and let …”
Section: The Tree Estimatementioning
confidence: 99%
“…From the energy bound (applied to multitiles) and the bound (14) for |φ P |, the right side is bounded by…”
Section: The Tree Estimatementioning
confidence: 99%
See 1 more Smart Citation
“…Instead of the Pichorides conjecture we shall then use the well known bounds for a martingale analogue, due to Chang, Wilson, and Wolff [2]. This philosophy also applies to the proof of Theorem 1.1; it has been used in other papers, among them [7], [8], [5] (see also references contained in these papers). …”
Section: And There Are the Following Upper And Lower Bounds For The Ementioning
confidence: 99%