Solvability of Rado systems in \(D\)-sets
From MaRDI portal
Publication:1032893
DOI10.1016/j.topol.2009.04.019zbMath1231.05269arXiv0809.2281OpenAlexW2014277634MaRDI QIDQ1032893
Tomasz Downarowicz, Vitaly Bergelson, Mathias Beiglböck, Alexander Fish
Publication date: 5 November 2009
Published in: Topology and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0809.2281
Related Items
A combinatorial proof of a stronger dense Hindman theorem ⋮ Sets satisfying the central sets theorem ⋮ Idempotent ultrafilters, multipleweak mixing and Szemerédi's theorem for generalized polynomials ⋮ \(D\)-sets in arbitrary semigroup ⋮ \(D\) sets and a Sárközy theorem for countable fields ⋮ New polynomial and multidimensional extensions of classical partition results ⋮ Richness of arithmetic progression in commutative semigroup ⋮ A history of central sets ⋮ Notions of size in a semigroup: an update from a historical perspective ⋮ Rado equations solved by linear combinations of idempotent ultrafilters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiplicative structures in additively large sets
- An ergodic Szemerédi theorem for IP-systems and combinatorial theory
- Topological dynamics and combinatorial number theory
- Algebra in the Stone-Čech compactification: theory and applications
- Studien zur Kombinatorik
- Finite sums from sequences within cells of a partition of N
- Infinite partition regular matrices
- Partitionen und lineare Gleichungssysteme
- Small Sets Satisfying the Central Sets Theorem
- Infinite partition regular matrices: solutions in central sets
- Nonmetrizable Topological Dynamics and Ramsey Theory
- Large sets of integers and hierarchy of mixing properties of measure preserving systems
- A new and stronger central sets theorem