Partitions and sums of integers with repetition

DOI10.1016/0097-3165(79)90004-9zbMath0419.05001OpenAlexW1998913995MaRDI QIDQ1132101

Neil Hindman

Publication date: 1979

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(79)90004-9

zbMATH Keywords

partitionarithmetic progressionrepetitionsequencesumadmissible

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Arithmetic progressions (11B25)

Related Items

On \(\text{IP}^*\) sets and central sets, Partitions and Sums and Products of Integers, Pairwise sums in colourings of the reals, Monochromatic infinite sumsets, Sumsets contained in infinite sets of integers, MONOCHROMATIC FACTORIZATIONS OF WORDS AND PERIODICITY, Coloring Problems for Infinite Words, Infinite monochromatic sumsets for colourings of the reals, Minimal ideals and cancellation in beta(N), Monochromatic sumset without large cardinals, Partitions and pairwise sums and products

Cites Work

• Partition theorems for subspaces of vector spaces
• Partition theorems for subsets of vector spaces
• Finite sums from sequences within cells of a partition of N
• A short proof of Hindman's theorem
• Ultrafilters: Some old and some new results
• A Short Proof of van der Waerden's Theorem on Arithmetic Progressions
• Partition relations for cardinal numbers
• The Existence of Certain Ultrafilters on N and a Conjecture of Graham and Rothschild
• Ramsey's Theorem for n-Parameter Sets