Classification theorems for sumsets modulo a prime
Hoi Nguyen, Van Vu

TL;DR
This paper establishes classification theorems for sumsets in finite fields of prime order, addressing when zero or all elements can be expressed as sums of subsequence elements, including sums of fixed length.
Contribution
It provides new classification results characterizing the conditions under which certain sumset representations are possible in prime order finite fields.
Findings
Characterization of when zero can be expressed as a sum of elements from A
Conditions for representing every element of Z/pZ as a sum of A's elements
Results on sums of exactly l elements from A
Abstract
Let be the finite field of prime order and be a subsequence of . We prove several classification results about the following questions: (1) When can one represent zero as a sum of some elements of ? (2) When can one represent every element of as a sum of some elements of ? (3) When can one represent every element of as a sum of elements of ?
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
TopicsAnalytic Number Theory Research · Limits and Structures in Graph Theory · Coding theory and cryptography
