Sets of Integers With No Long Arithmetic Progressions Generated by the Greedy Algorithm

DOI10.2307/2006472zbMath0417.10046OpenAlexW4232754347MaRDI QIDQ3207069

L. Thomas Ramsey, Joseph L. Gerver

Publication date: 1979

Published in: Mathematics of Computation (Search for Journal in Brave)

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

zbMATH Keywords

greedy algorithmarithmetic progressionasymptotic density

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Software, source code, etc. for problems pertaining to number theory (11-04) Arithmetic progressions (11B25)

Related Items (8)

On the growth of the counting function of Stanley sequences ⋮ On \(\text{AP}_{3}\)-covering sequences ⋮ On generalized Stanley sequences ⋮ A note on \(AP_3\)-covering sequences ⋮ A generalization of sets without long arithmetic progressions based on Szekeres algorithm ⋮ On sequences without geometric progressions ⋮ Greedily Partitioning the Natural Numbers into Sets Free of Arithmetic Progressions ⋮ Greedy algorithm, arithmetic progressions, subset sums and divisibility

This page was built for publication: Sets of Integers With No Long Arithmetic Progressions Generated by the Greedy Algorithm