A combinatorially large cell of a partition of N

DOI10.1016/0097-3165(87)90075-6zbMath0642.05003OpenAlexW2006591791MaRDI QIDQ1101113

Neil Hindman, Vitaly Bergelson

Publication date: 1988

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(87)90075-6

zbMATH Keywords

partitionarithmetic progressionsnatural numbers

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)

Related Items

On \(\text{IP}^*\) sets and central sets ⋮ Infinite partition regular matrices ⋮ Abstract colorings, games and ultrafilters ⋮ Iterated Spectra of Numbers—Elementary, Dynamical, and Algebraic Approaches ⋮ Sums of idempotents in \(\beta{}\mathbb{N}\) ⋮ Ultrafilters and multidimensional Ramsey theorems ⋮ Additive and multiplicative Ramsey theory in the reals and the rationals ⋮ Some new multi-cell Ramsey theoretic results ⋮ Nonmetrizable Topological Dynamics and Ramsey Theory ⋮ Multiplicatively large sets and ergodic Ramsey theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ramsey's theorem for sums, products, and arithmetic progressions
• A density statement generalizing Schur's theorem
• The ideal structure of the space of \(\kappa\)-uniform ultrafilters on a discrete semigroup
• Density versions of two generalizations of Schur's theorem
• Partitions and sums of \((m,p,c)\)-sets
• Minimal ideals and cancellation in beta(N)
• Partitionen und lineare Gleichungssysteme
• On sets of integers containing k elements in arithmetic progression
• Partitions and Sums and Products of Integers