Greedily Partitioning the Natural Numbers into Sets Free of Arithmetic Progressions

DOI10.2307/2047261zbMath0658.05007OpenAlexW4246167497MaRDI QIDQ3807217

James Propp, Joseph L. Gerver, R. Jamie Simpson

Publication date: 1988

Full work available at URL: https://doi.org/10.2307/2047261

zbMATH Keywords

partitionsgreedy algorithm

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81) Arithmetic progressions (11B25)

Related Items (3)

Variants of Base 3 over 2 ⋮ On sequences without geometric progressions ⋮ Greedy algorithm, arithmetic progressions, subset sums and divisibility

Cites Work

• Unnamed Item
• The ergodic theoretical proof of Szemerédi’s theorem
• Sets of Integers With No Long Arithmetic Progressions Generated by the Greedy Algorithm
• Irregular Sets of Integers Generated by the Greedy Algorithm
• On sets of integers containing k elements in arithmetic progression
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• Unsolved problems in number theory

This page was built for publication: Greedily Partitioning the Natural Numbers into Sets Free of Arithmetic Progressions