Additive Decompositions of Subgroups of Finite Fields
Igor Shparlinski

TL;DR
This paper investigates how multiplicative subgroups of finite fields can be expressed as sums of two sets, improving previous results on quadratic residues and primitive roots using advanced bounds and additive combinatorics.
Contribution
It provides new bounds and generalizations for additive decompositions of subgroups in finite fields, extending prior work on quadratic residues and primitive roots.
Findings
Improved bounds on additive decompositions of quadratic residues.
Generalizations of previous results on primitive roots.
Application of Karatsuba bound and additive combinatorics tools.
Abstract
We say that a set is additively decomposed into two sets and , if . Here we study additively decompositions of multiplicative subgroups of finite fields. In particular, we give some improvements and generalisations of results of C. Dartyge and A. Sarkozy on additive decompositions of quadratic residues and primitive roots modulo . We use some new tools such the Karatsuba bound of double character sums and some results from additive combinatorics.
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 · Finite Group Theory Research · graph theory and CDMA systems
