2023/08/27 by Ilya D. Shkredov, Shkredov, Ilya D.
Computer Science · Mathematics · #Analytic Number Theory Research #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #Number Theory (math.NT)
paper · pdf · doi:10.48550/arxiv.2308.14069
openalex publication_date 2023/08/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In our paper, we apply additive-combinatorial methods to study the distribution of the set of squares R in the prime field. We obtain the best upper bound on the number of gaps in R at the moment and generalize this result for sets with small doubling.