A Polynomial Method Approach to Zero-Sum Subsets in Fp2
Abstract
In this paper we prove that every subset of Fp2 meeting all p+1 lines passing through the origin has a zero-sum subset. This is motivated by a result of Gao, Ruzsa and Thangadurai which states that OL(Fp2)=p+OL(Fp)-1, for sufficiently large primes p. Here OL(G) denotes the so-called Olson constant of the additive group G and represents the smallest integer such that no subset of cardinality OL(G) is zero-sum-free. Our proof is in the spirit of the Combinatorial Nullstellensatz.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.