Solvability of Rado systems in D-sets

DOI10.1016/J.TOPOL.2009.04.019zbMATH Open1231.05269arXiv0809.2281OpenAlexW2014277634MaRDI QIDQ1032893FDOQ1032893

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)

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.

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

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
• On covering problems of Rado
• On Covering Problems of Rado

zbMATH Keywords

central sets\(D\)-setsRado system

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• 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
• Finite sums from sequences within cells of a partition of N
• Nonmetrizable Topological Dynamics and Ramsey Theory
• Title not available (Why is that?)
• Large sets of integers and hierarchy of mixing properties of measure preserving systems
• Multiplicative structures in additively large sets
• Studien zur Kombinatorik
• Partitionen und lineare Gleichungssysteme
• A new and stronger central sets theorem
• Small Sets Satisfying the Central Sets Theorem
• Infinite partition regular matrices
• Infinite partition regular matrices: solutions in central sets
• Title not available (Why is that?)

Cited In (12)

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

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)