Polynomial recurrence with large intersection over countable fields

DOI10.1007/S11856-016-1346-1zbMATH Open1365.37009arXiv1409.6774OpenAlexW2215078576MaRDI QIDQ312249FDOQ312249

Authors: V. Bergelson, Donald Robertson 

Publication date: 15 September 2016

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Abstract: We give a short proof of polynomial recurrence with large intersection for additive actions of finite-dimensional vector spaces over countable fields on probability spaces, improving upon the known size and structure of the set of strong recurrence times.

Full work available at URL: https://arxiv.org/abs/1409.6774

Recommendations

• Polynomial multiple recurrence over rings of integers
• An ergodic IP polynomial Szemerédi theorem
• Khintchine-type recurrence for 3-point configurations
• Polynomial Szemerédi theorems for countable modules over integral domains and finite fields
• Simultaneous polynomial recurrence

zbMATH Keywords

polynomial recurrencestrong recurrence time

Mathematics Subject Classification ID

Relations between ergodic theory and number theory (37A44)

Cites Work

• An ergodic Szemerédi theorem for IP-systems and combinatorial theory
• Topological dynamics and combinatorial number theory
• On \(\text{IP}^*\) sets and central sets
• Finite sums from sequences within cells of a partition of N
• Ultrafilters, IP sets, dynamics, and combinatorial number theory
• Nonmetrizable Topological Dynamics and Ramsey Theory
• Regularity and Positional Games
• Algebra in the Stone-Čech compactification. Theory and applications
• Polynomial multiple recurrence over rings of integers
• Polynomial Szemerédi theorems for countable modules over integral domains and finite fields
• D sets and IP rich sets in \(\mathbb {Z}\)
• Title not available (Why is that?)
• \(D\) sets and a Sárközy theorem for countable fields
• Large sets of integers and hierarchy of mixing properties of measure preserving systems

Cited In (8)

• Van der Corput's difference theorem: some modern developments
• Failure of Khintchine-type results along the polynomial image of \(\mathrm{IP}_0\) sets
• Cartesian products of two CR sets
• Measure preserving actions of affine semigroups and patterns
• Nil Bohr\(_0\)-sets and polynomial recurrence
• D sets and IP rich sets in countable, cancellative abelian semigroups
• Multiplicative richness of additively large sets in \(\mathbb{Z}^d\)
• On the interplay between additive and multiplicative largeness and its combinatorial applications

This page was built for publication: Polynomial recurrence with large intersection over countable fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q312249)