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

DOI10.2307/2006472MaRDI QIDQ3207069zbMATH OpenOpenAlexFDO

Authors Joseph L. Gerver, L. Thomas Ramsey

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

arithmetic progressionasymptotic densitygreedy algorithm

Mathematics Subject Classification ID

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

Cited in

(8)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3207069)