Complexities of finite families of polynomials, Weyl systems, and constructions in combinatorial number theory

DOI10.1007/s11854-008-0002-zzbMath1146.37007MaRDI QIDQ926375

Vitaly Bergelson, Alexander Leibman, Emmanuel Lesigne

Publication date: 27 May 2008

Published in: Journal d'Analyse Mathématique (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11854-008-0002-z

zbMATH Keywords

arithmetic progressions; measure-preserving transformations; polynomial Szemerédi theorem; complexity of a system of polynomials

Mathematics Subject Classification ID

28D05: Measure-preserving transformations

05D10: Ramsey theory

11B25: Arithmetic progressions

Related Items

Sets of large values of correlation functions for polynomial cubic configurations, Some open problems on multiple ergodic averages, True complexity of polynomial progressions in finite fields, Multiple ergodic averages for flows and an application, Intersective polynomials and the polynomial Szemerédi theorem, Concatenation theorems for anti-Gowers-uniform functions and Host-Kra characteristic factors, Multiple ergodic averages for three polynomials and applications, Orbit of the diagonal in the power of a nilmanifold

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence of polynomial ergodic averages
• Polynomial averages converge to the product of integrals
• Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
• Convergence of multiple ergodic averages along polynomials of several variables
• Nonconventional ergodic averages and nilmanifolds
• Universal characteristic factors and Furstenberg averages
• Multiple ergodic averages for three polynomials and applications
• Weakly mixing PET
• On sets of integers containing k elements in arithmetic progression
• Polynomial extensions of van der Waerden’s and Szemerédi’s theorems