2016/06/01 by Ilya D. Shkredov, Shkredov, Ilya D., Aleksei Volostnov +1 · 1 citation
Mathematics · #Analytic Number Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Limits and Structures in Graph Theory #Number Theory (math.NT)
paper · pdf · doi:10.48550/arxiv.1606.00358
openalex publication_date 2016/06/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In the paper we obtain new estimates for binary and ternary sums of multiplicative characters with additive convolutions of characteristic functions of sets, having small additive doubling. In particular, we improve a result of M.-C. Chang. The proof uses Croot-Sisask almost periodicity lemma.