Squares and difference sets in finite fields
Christine Bachoc, Imre Z. Ruzsa, Mate Matolcsi

TL;DR
This paper improves the upper bound on the size of subsets in finite fields with difference sets containing only quadratic residues, showing that for many primes the maximum size is slightly less than the trivial bound.
Contribution
It provides a refined upper bound for the maximal size of such sets in finite fields for a large class of primes, improving upon the trivial bound.
Findings
New upper bound $|B| extless \sqrt{p}$ for many primes
Bound holds for approximately three quarters of primes of form $4k+1$
Result narrows the gap between trivial and actual maximum set sizes
Abstract
For infinitely many primes we give a slightly improved upper bound for the maximal cardinality of a set such that the difference set contains only quadratic residues. Namely, instead of the "trivial" bound we prove , under suitable conditions on . The new bound is valid for approximately three quarters of the primes .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Finite Group Theory Research
