On some double sums with multiplicative characters
We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.
math.NT↗
arXiv subjects
Aleksei S. Volostnov
Publications and source records attributed to Aleksei S. Volostnov.
Sums of multiplicative characters with additive convolutions
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.
math.NT↗