A Polya-Vinogradov-type inequality on $\mathbb{Z}[i]$
Stephan Baier

TL;DR
This paper extends the classical Polya-Vinogradov inequality to the setting of Gaussian integers, providing bounds for character sums over this complex integer domain.
Contribution
It introduces a Polya-Vinogradov-type inequality specifically for multiplicative characters on the Gaussian integers, a novel extension of classical bounds.
Findings
Established a new bound for character sums over
Extended classical inequalities to complex quadratic integer rings
Provides tools for analytic number theory in
Abstract
We establish a Polya-Vinogradov-type bound for finite periodic multipicative characters on the Gaussian integers.
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
TopicsGraph theory and applications · Mathematical Approximation and Integration · advanced mathematical theories
