Papers
Topics
Authors
Recent
Search
2000 character limit reached

Distinguishing Gauss sums

Published 23 Sep 2026 in math.NT | (2609.28211v1)

Abstract: Let $\F_q$ be the field of order q=p<sup>fq = p<sup>f for prime pp. If G(χ)G(χ) is the Gauss sum attached to a multiplicative character χχ on $\F_q<sup>\times$, then G(χ)=G(χ<sup>p)G(χ) = G(χ<sup>p). We investigate the converse question: when does the equality of Gauss sums G(χ2)=G(χ1)G(χ_2) = G(χ_1) imply that χ2=χ1<sup>p<sup>jχ_2 = χ_1<sup>{p<sup>j} for some integer jj. If χ2=χ1<sup>p<sup>jχ_2 = χ_1<sup>{p<sup>j}, we say that χ1χ_1 and χ2χ_2 are Frobenius-conjugate. We use the Stickelberger factorization of ideals in cyclotomic fields to give an easily testable criterion for equality of Gauss sums, based on pp-adic digit expansion. As an application, we develop several conditions under which Gauss sum equalities between characters on $\F_q<sup>\times$ are explained by Frobenius-conjugacy. For example, if χ1χ_1 has order q−1q-1 or 12(q−1)\frac{1}{2}(q-1) and G(χ2)=G(χ1)G(χ_2) = G(χ_1), then χ1χ_1 and χ2χ_2 are Frobenius-conjugate. We also include several examples, based on the explicit evaluation of certain {\em pure} Gauss sums by R.J. Evans.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.