On The Cap Set Problem

upper bounds on maximal cardinalities of caps in dimensions seven to ten

Bachelor thesis (2017)

Authors

N.D. Versluis Electrical Engineering, Mathematics and Computer Science

Contributors

Dion Gijswijt (mentor)
E.M. van Elderen (graduation committee member)
J.A.M. de Groot (graduation committee member)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
Copyright: © 2017 Nina Versluis
More Info
expand_more

Published Date

2017-7

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

This thesis concerns the cap set problem in affine geometry. The problem is illustrated by the card game SET and its geometrical interpretation in ternary affine space. The maximal cardinality of a cap is known for the dimension one to six. For the four lowest dimensions, a maximal cap is constructed and the optimality of its size proven. From there, two recursive methods are described and applied to obtain upper bounds for the maximal size of caps in dimensions seven to ten. The best found upper bounds are 291, 771, 2070 and 5619, respectively.

Files

Bachelor_Thesis_Nina_D_Verslui... (pdf)
(pdf | 1.04 Mb)
Unknown license