Cyclicity of Drinfeld modules modulo primes in arithmetic progressions

arXiv:2611.03607 · math.NT · Submitted 2026-11-02 · Read on arXiv

math.NT

Submitted: 2026-11-02

Updated: 2026-11-02

License: http://creativecommons.org/licenses/by/4.0/

The gist: Let A= F q[T] and K= F q(T), and let ϕ be a Drinfeld A-module over K of rank r at least 2.

Abstract

Let A= F q[T] and K= F q(T), and let ϕ be a Drinfeld A-module over K of rank r at least 2. We study the reduction of ϕ at primes p in A lying in a prescribed arithmetic progression, for which ϕ(F p) has at most r-1 cyclic components. We obtain asymptotic formulas for the number of such primes of a given degree, with error bounds uniform in the modulus of the arithmetic progression. Furthermore, when End K(ϕ)=A, we sharpen the error term and, under additional hypotheses, establish a necessary and sufficient condition for positivity of the resulting density.

Sources

Related papers