2000 character limit reached
Shanks bias in function fields (2509.16142v1)
Published 19 Sep 2025 in math.NT
Abstract: We study the function field analogue of Shanks bias. For Liouville function $\lambda(f)$, we compare the number of monic polynomials $f$ with $\lambda(f) \chi_m(f) = 1$ and $\lambda(f) \chi_m(f) = -1$ for a nontrivial quadratic character $\chi_m$ modulo a monic square-free polynomial $m$ over a finite field. Under Grand Simplicity Hypothesis (GSH) for $L$-functions, we prove that $\lambda \cdot \chi_m$ is biased towards $+1$. We also give some examples where GSH is violated.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.