An improved construction of progression-free sets

2011/07/30 by Michael Elkin · 43 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Advanced Topology and Set Theory #Binary logarithm #Combinatorics #Discrete mathematics #Limits and Structures in Graph Theory #Mathematical analysis #Mathematics #Omega #Physics #Quantum mechanics #Upper and lower bounds

paper · doi:10.1007/s11856-011-0061-1

published in Israel Journal of Mathematics 184(1), 93-128 (Springer Science and Business Media LLC)

openalex publication_date 2011/07/30 · crossref created 2011/07/30 · crossref issued 2011/07/31 · crossref published 2011/07/31 · crossref published-online 2011/07/31 · crossref published-print 2011/08/01 · crossref deposited 2019/06/13 · openalex created_date 2025/10/10 · crossref indexed 2026/07/17 · openalex updated_date 2026/07/29

Citations

• �ber die Gitterpunkte auf konvexen Kurven
• On sets of integers containing k elements in arithmetic progression
• On sets of integers not containing long arithmetic progressions
• Vampiros y hombres lobo, ¿mito o ciencia?
• On Some Sequences of Integers
• Roth’s theorem on progressions revisited
• On Certain Sets of Integers

Cited by

• Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
• No-three-in-line problem [wikipedia]