论文标题
上限集问题：41-CAP 5-FLATS
The cap set problem: 41-cap 5-flats
论文作者
论文摘要
S-CAP n-flat或大小为s的n维盖是一对（s，f），其中f是z/3z上的n维仿射空间，而f的尺寸子集s不包含共线点的三倍。尺寸N中的CAP设置问题询问S-CAP N-Flat存在的最大s。这一系列文章调查了限制和包括7的CAP集问题。这是该系列的第二篇论文。 通过在该系列的第一篇论文中应用和适应方法，我们将大小至少41的所有5维盖进行系统地分类。
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.
