Greedily Partitioning the Natural Numbers into Sets Free of Arithmetic Progressions
From MaRDI portal
Publication:3807217
DOI10.2307/2047261zbMath0658.05007MaRDI QIDQ3807217
James Propp, R. Jamie Simpson, Joseph L. Gerver
Publication date: 1988
Full work available at URL: https://doi.org/10.2307/2047261
05A10: Factorials, binomial coefficients, combinatorial functions
05A17: Combinatorial aspects of partitions of integers
11P81: Elementary theory of partitions
11B25: Arithmetic progressions
Related Items
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