REVIEW 2 cited by
Joint ergodicity for commuting transformations and applications to polynomial sequences
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We give necessary and sufficient conditions for joint ergodicity results of collections of sequences with respect to systems of commuting measure preserving transformations. Combining these results with a new technique that we call "seminorm smoothening", we settle several conjectures related to multiple ergodic averages of commuting transformations with polynomial iterates. We show that the Host-Kra factor is characteristic for pairwise independent polynomials, and that under certain ergodicity conditions the associated ergodic averages converge to the product of integrals. Moreover, when the polynomials are linearly independent, we show that the rational Kronecker factor is characteristic and deduce Khintchine-type lower bounds for the related multiple recurrence problem. Finally, we prove a nil plus null decomposition result for multiple correlation sequences of commuting transformations in the case where the iterates are given by families of pairwise independent polynomials.
Forward citations
Cited by 2 Pith papers
-
Multi-Parameter Exponential Sums with Product Hilbert Kernels
The uniform boundedness of multi-parameter exponential sums with product Hilbert kernels holds iff the polynomial index set Λ has no odd subset or every monomial in Λ has at most one odd component.
-
Undecidability in the Ramsey theory of polynomial equations and Hilbert's tenth problem
Partition regularity of polynomial equations over Z is undecidable if Hilbert's tenth problem over Q is undecidable, and over function fields it is unconditionally Pi_2^0-complete.
Discussion (0). Continue with ORCID to comment.