Greedy capsets
Combinatorics
2025-02-11 v1
Abstract
A capset is a subset 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.
Cite
@article{arxiv.2502.06005,
title = {Greedy capsets},
author = {Oliver Dawson and Oleg Shuvaev and José Felipe Voloch},
journal= {arXiv preprint arXiv:2502.06005},
year = {2025}
}