A note on the extensible no-three-in-line problem
Abstract
We show the existence of a set S⊂Z2 avoiding collinear triples satisfying |S [n]2|=(n/ n) for sufficiently large n. This improves on the best-known lower bound on Erde's extensible no-three-in-line problem due to Nagy, Nagy and Woodroofe by n, leaving the same gap to the trivial upper bound. Our construction is random.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.