Ties in Function Field Prime Races
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)× for which π(N; m, c1) = π(N; m, c2) = … = π(N; m, ck) holds for infinitely many N. We provide infinitely many examples of (m, c1, …, ck) for which the tie holds whenever N satisfies certain congruence conditions. We give two different proofs: first, via the explicit formula for prime counts in terms of L-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)-action. Our examples also include characteristic 2 cases.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.