The cap set problem: Up to dimension 7
Combinatorics
2022-06-22 v1
Abstract
An s-cap n-flat is given by a set of s points, no three of which are on a common line, in an n-dimensional affine space over the field of three elements. The cap set problem in dimension n is: what is the maximum s such that there is an s-cap n-flat? The first two papers in this series of articles considered the cap set problem in dimensions up to and including 5. In this paper, which is the third in the series, we consider dimensions 6 and 7: we prove that every 110-cap 6-flat is a 112-cap 6-flat minus two cap points, and that there are no 289-cap 7-flats.
Keywords
Cite
@article{arxiv.2206.09804,
title = {The cap set problem: Up to dimension 7},
author = {Henry Robert Thackeray},
journal= {arXiv preprint arXiv:2206.09804},
year = {2022}
}
Comments
16 pages, 4 figures