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

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.Comment: Revised version. To appear in SIAM Journal on Discrete Mathematic

How many cards should you lay out in a game of EvenQuads?: A detailed study of 2-caps in AG(n,2)

A 2-cap in the affine geometry $AG(n, q)$ is a subset of 4 points in general position. In this paper we classify all 2-caps in $AG(n, 2)$, up to affine equivalence, for $n \leq 6$. We also provide structural results for general $n$. Since the EvenQuads card deck is a model for $AG(6, 2)$, as a consequence we determine the probability that an arbitrary $k$-card layout contains a quad.Comment: 36 pages, 20 figures, 5 table

On 4-general sets in finite projective spaces

A $4$-general set in ${\rm PG}(n,q)$ is a set of points of ${\rm PG}(n,q)$ spanning the whole ${\rm PG}(n,q)$ and such that no four of them are on a plane. Such a pointset is said to be complete if it is not contained in a larger $4$-general set of ${\rm PG}(n, q)$. In this paper upper and lower bounds for the size of the largest and the smallest complete $4$-general set in ${\rm PG}(n,q)$, respectively, are investigated. Complete $4$-general sets in ${\rm PG}(n,q)$, $q \in \{3,4\}$, whose size is close to the theoretical upper bound are provided. Further results are also presented, including a description of the complete $4$-general sets in projective spaces of small dimension over small fields and the construction of a transitive $4$-general set of size $3(q + 1)$ in ${\rm PG}(5, q)$, $q \equiv 1 \pmod{3}$