Sums of multiplicative characters with additive convolutions
classification
🧮 math.NT
math.CO
keywords
additivecharactersconvolutionsmultiplicativesumsalmostbinarychang
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.