Improved bounds on sizes of generalized caps in $AG(n,q)$

Abstract

An $m$-general set in $AG(n,q)$ is a set of points such that any subset of size $m$ is in general position. A $3$-general set is often called a capset. In this paper, we study the maximum size of an $m$-general set in $AG(n,q)$, significantly improving previous results. When $m=4$ and $q=2$ we give a precise estimate, solving a problem raised by Bennett.

Revised version. To appear in SIAM Journal on Discrete Mathematics

Cited by in corpus (3)

• Sidon sets, sum-free sets and linear codes
• How many cards should you lay out in a game of EvenQuads?: A detailed study of caps in AG(n,2)
• A Small Maximal Sidon Set In $Z_2^n$