Multiplicative Subgroups of Prime Fields Are Not Sumsets
Combinatorics
2026-07-27 v1
Abstract
Let be a proper multiplicative subgroup, and suppose that for some . We prove that either one of the summands is a singleton, or and . In particular, no proper multiplicative subgroup of can be written as with . Our proof builds on the Hanson-Petridis polynomial method and Kalmynin's subsequent resolution of S\'ark\"ozy's conjecture for quadratic residues. Using Kalmynin's theorem as a structural input, we develop uniform combinatorial and arithmetic arguments which apply to multiplicative subgroups of arbitrary index.
Keywords
Cite
@article{arxiv.2607.24270,
title = {Multiplicative Subgroups of Prime Fields Are Not Sumsets},
author = {Misha Rudnev and Fred Tyrrell},
journal= {arXiv preprint arXiv:2607.24270},
year = {2026}
}
Comments
40 pages