A Polynomial Method Approach to Zero-Sum Subsets in $\mathbb{F}_{p}^{2}$
Combinatorics
2017-03-02 v1 Number Theory
Abstract
In this paper we prove that every subset of meeting all lines passing through the origin has a zero-sum subset. This is motivated by a result of Gao, Ruzsa and Thangadurai which states that , for sufficiently large primes . Here denotes the so-called Olson constant of the additive group and represents the smallest integer such that no subset of cardinality is zero-sum-free. Our proof is in the spirit of the Combinatorial Nullstellensatz.
Cite
@article{arxiv.1703.00414,
title = {A Polynomial Method Approach to Zero-Sum Subsets in $\mathbb{F}_{p}^{2}$},
author = {Cosmin Pohoata},
journal= {arXiv preprint arXiv:1703.00414},
year = {2017}
}
Comments
6 pages; comments welcome!