Solvability of Rado systems in D-sets

DOI10.1016/J.TOPOL.2009.04.019MaRDI QIDQ1032893zbMATH OpenOpenAlexFDO

Authors T. Downarowicz, Mathias Beiglböck, V. Bergelson, 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

zbMATH Keywords

central sets\(D\)-setsRado system

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Ramsey theory (05D10)

Abstract: Rado's Theorem characterizes the systems of homogenous linear equations having the property that for any finite partition of the positive integers one cell contains a solution to these equations. Furstenberg and Weiss proved that solutions to those systems can in fact be found in every central set. (Since one cell of any finite partition is central, this generalizes Rado's Theorem.) We show that the same holds true for the larger class of $D$-sets. Moreover we will see that the conclusion of Furstenberg's Central Sets Theorem is true for all sets in this class.

Recommendations

• Radii of solvability and unsolvability of linear systems
• Solvability problems for \(ND\)-systems
• scientific article; zbMATH DE number 3914535
• Solution of a problem of Radul on absorbing sets
• Rado equations solved by linear combinations of idempotent ultrafilters
• On the Solution Sets of Entire Systems of Word Equations
• scientific article; zbMATH DE number 3293178
• scientific article; zbMATH DE number 3858310
• On covering problems of Rado
• On Covering Problems of Rado

Cites work

• scientific article; zbMATH DE number 3719449 (Why is no real title available?)
• scientific article; zbMATH DE number 1978350 (Why is no real title available?)
• scientific article; zbMATH DE number 2070330 (Why is no real title available?)
• A new and stronger central sets theorem
• Algebra in the Stone-Čech compactification: theory and applications
• An ergodic Szemerédi theorem for IP-systems and combinatorial theory
• Finite sums from sequences within cells of a partition of N
• Infinite partition regular matrices
• Infinite partition regular matrices: solutions in central sets
• Large sets of integers and hierarchy of mixing properties of measure preserving systems
• Multiplicative structures in additively large sets
• Nonmetrizable Topological Dynamics and Ramsey Theory
• Partitionen und lineare Gleichungssysteme
• Small Sets Satisfying the Central Sets Theorem
• Studien zur Kombinatorik
• Topological dynamics and combinatorial number theory

Cited in

(12)

• Dynamical characterization of C-sets and its application
• \(D\) sets and a Sárközy theorem for countable fields
• Sets satisfying the central sets theorem
• \(D\)-sets in arbitrary semigroup
• A combinatorial proof of a stronger dense Hindman theorem
• Notions of size in a semigroup: an update from a historical perspective
• A history of central sets
• New polynomial and multidimensional extensions of classical partition results
• Richness of arithmetic progressions in commutative semigroups
• Solvability of linear equations within weak mixing sets
• Idempotent ultrafilters, multipleweak mixing and Szemerédi's theorem for generalized polynomials
• Rado equations solved by linear combinations of idempotent ultrafilters

This page was built for publication: Solvability of Rado systems in \(D\)-sets

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