English

An inverse theorem on sets with rich additive structure modulo primes

Number Theory 2025-12-05 v2 Combinatorics

Abstract

In this paper, we prove several results on the structure of maximal sets S[N]S \subseteq [N] such that SS mod pp is contained in a short arithmetic progression, or the union of short progressions, where pp ranges over a subset of primes in an interval [y,2y][y,2y] with (logN)O(1)<yN(\log N)^{O(1)} < y \leq N. We also provide several constructions demonstrating the sharpness of our results. Furthermore, as an application, we provide several improvements on the larger sieve bound for S|S| when SS mod pp has strong additive structure, parallel to the work of Green--Harper and Shao for improvements on the large sieve.

Keywords

Cite

@article{arxiv.2510.08862,
  title  = {An inverse theorem on sets with rich additive structure modulo primes},
  author = {Ernie Croot and Junzhe Mao and Chi Hoi Yip},
  journal= {arXiv preprint arXiv:2510.08862},
  year   = {2025}
}

Comments

30 pages. This version contains substantially stronger results and several new results

R2 v1 2026-07-01T06:28:23.258Z