English

Ties in Function Field Prime Races

Number Theory 2026-04-07 v3

Abstract

The function field analogue of Chebyshev's bias was first studied by Cha. In this paper, we study *ties* in this race, namely collections of distinct congruence classes c1,,ck(Fq[T]/m)×c_1, \dots, c_k \in (\mathbb{F}_q[T] / m)^\times for which π(N;m,c1)=π(N;m,c2)==π(N;m,ck)\pi(N; m, c_1) = \pi(N; m, c_2) = \dots = \pi(N; m, c_k) holds for infinitely many NN. We provide infinitely many examples of (m,c1,,ck)(m, c_1, \dots, c_k) for which the tie holds whenever NN satisfies certain congruence conditions. We give two different proofs: first, via the explicit formula for prime counts in terms of LL-functions together with a matrix analogue of M\"obius inversion, where exceptional pairs of Galois-conjugate elements in the corresponding cyclotomic fields produce ties; and second, via an explicit bijection arising from the GL2(Fq)\mathrm{GL}_2(\mathbb{F}_q)-action. Our examples also include characteristic 2 cases.

Cite

@article{arxiv.2603.21005,
  title  = {Ties in Function Field Prime Races},
  author = {Graeme Bates and Ryan Jesubalan and Seewoo Lee and Jane Lu and Hyewon Shim},
  journal= {arXiv preprint arXiv:2603.21005},
  year   = {2026}
}

Comments

24 pages, 6 tables

R2 v1 2026-07-01T11:31:49.470Z