Computing endomorphism rings and Frobenius matrices of Drinfeld modules

From MaRDI portal
Publication:2127200




Abstract: Let mathbbFq[T] be the polynomial ring over a finite field mathbbFq. We study the endomorphism rings of Drinfeld mathbbFq[T]-modules of arbitrary rank over finite fields. We compare the endomorphism rings to their subrings generated by the Frobenius endomorphism and deduce from this a refinement of a reciprocity law for division fields of Drinfeld modules proved in our earlier paper. We then use these results to give an efficient algorithm for computing the endomorphism rings and discuss some interesting examples produced by our algorithm.



Cites work









This page was built for publication: Computing endomorphism rings and Frobenius matrices of Drinfeld modules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2127200)