Conjecture on optimal cancellation for prime-power Gauss sums

Less than 1 year old · traced to

Let pp be a prime and k≥1k\ge 1 an integer. Let χ ⁣:Fq×→C×\chi\colon \mathbb{F}_q^\times\to\mathbb{C}^\times be a non-trivial character of order o=ord⁡(χ)o=\operatorname{ord}(\chi), where o=pko=p^k, or o=2pko=2p^k when pp is odd. The normalized prime-polynomial Gauss-sum sum is

∣∑deg⁡(π)=nπ prime⁡Gχ(π)qn/2∣=q(12+1pk+o(1))n.\left|\sum_{\substack{\deg(\pi)=n\\ \pi\ \operatorname{prime}}} \frac{G_\chi(\pi)}{q^{n/2}}\right|=q^{\left(\frac12+\frac1{p^k}+o(1)\right)n}.

In the analogous number-field setting, the bias in order-oo Gauss sums is (1+o(1))X12+1pk/log⁡X(1+o(1))X^{\frac12+\frac1{p^k}}/\log X. Optimal-cancellation conjecture. The stated asymptotics hold for the function-field and corresponding number-field Gauss-sum biases under these order conditions. The conjecture asserts that the exponent in the proven upper bound is optimal, while the paper notes that the separate factor 22n−12^{2n-1} from the Betti-number estimate may be improvable because homology should concentrate away from the vanishing slope.

References

Primary source

Zhao Yu Ma, “Optimal homological vanishing: cancellation of character sums and Patterson's conjecture over F_q[t]”, arXiv:2606.26440 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.