Zero subsums in vector spaces over finite fields
Abstract
The Olson constant OL(Fpd) represents the minimum positive integer t with the property that every subset A⊂ Fpd of cardinality t contains a nonempty subset with vanishing sum. The problem of estimating OL(Fpd) is one of the oldest questions in additive combinatorics, with a long and interesting history even for the case d=1. In this paper, we prove that for any fixed d ≥ 2 and ε > 0, the Olson constant of Fpd satisfies the inequality OL(Fpd) ≤ (d-1+ε)p for all sufficiently large primes p. This settles a conjecture of Hoi Nguyen and Van Vu.
0