Greedy capsets
Abstract
A capset is a subset C ⊂ F3n with no three points on a line. We characterise the capsets produced by successively removing points from the ambient space such that the removed point has the maximum number of lines contained in the set of remaining points and passing through it until the set of remaining points contains no lines.
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.