Explorations of geometric combinatorics in vector spaces over finite fields

Abstract

We study how large a set of points needs to be in a vector space over a finite field in order for the points to determine all of a certain type of geometric structure. In addition we show that there are key differences between the finite field version of these questions and the corresponding euclidean versions. Several arithmetic consequences are also explored.