The cap set problem: 41-cap 5-flats

Publication date 20 June 2022

Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20) Combinatorial aspects of packing and covering (05B40) Finite affine and projective planes (geometric aspects) (51E15) Extremal combinatorics (05D99)

Abstract: An s-cap n-flat, or an n-dimensional cap of size s, is a pair (S,F) where F is an n-dimensional affine space over Z/3Z and the size-s subset S of F contains no triple of collinear points. The cap set problem in dimension n asks for the largest s for which an s-cap n-flat exists. This series of articles investigates the cap set problem in dimensions up to and including 7. This is the second paper in the series. By applying and adapting methods from the first paper in the series, we systematically classify all 5-dimensional caps of size at least 41.

This page was built for publication: The cap set problem: 41-cap 5-flats

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6402585)