Greedy capsets
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915144470102016 |
|---|---|
| author | Dawson, Oliver Shuvaev, Oleg Voloch, José Felipe |
| author_facet | Dawson, Oliver Shuvaev, Oleg Voloch, José Felipe |
| contents | A capset is a subset $C \subset \mathbb{F}_3^n$ 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_06005 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Greedy capsets Dawson, Oliver Shuvaev, Oleg Voloch, José Felipe Combinatorics 51E22 A capset is a subset $C \subset \mathbb{F}_3^n$ 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. |
| title | Greedy capsets |
| topic | Combinatorics 51E22 |
| url | https://arxiv.org/abs/2502.06005 |