2000 character limit reached
A Polynomial Method Approach to Zero-Sum Subsets in $\mathbb{F}_{p}^{2}$
Published 1 Mar 2017 in math.CO and math.NT | (1703.00414v1)
Abstract: In this paper we prove that every subset of $\mathbb{F}p2$ 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(\mathbb{F}{p}{2})=p+OL(\mathbb{F}_{p})-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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.