Computing endomorphism rings and Frobenius matrices of Drinfeld modules
Number Theory
2019-08-07 v1
Abstract
Let be the polynomial ring over a finite field . We study the endomorphism rings of Drinfeld -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.
Cite
@article{arxiv.1908.01805,
title = {Computing endomorphism rings and Frobenius matrices of Drinfeld modules},
author = {Sumita Garai and Mihran Papikian},
journal= {arXiv preprint arXiv:1908.01805},
year = {2019}
}
Comments
16 pages