On some double sums with multiplicative characters
Aleksei S. Volostnov
TL;DR
This paper introduces a new upper bound for binary sums involving multiplicative characters over sets with small additive doubling, advancing understanding of character sums in number theory.
Contribution
It provides a novel upper bound for binary sums with multiplicative characters over sets with small additive doubling, improving previous estimates.
Findings
New upper bound for binary sums with multiplicative characters
Enhanced understanding of sums over sets with small additive doubling
Potential applications in analytic number theory
Abstract
We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Limits and Structures in Graph Theory · Finite Group Theory Research