2016
DOI: 10.48550/arxiv.1608.02788
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Finding Endomorphisms of Drinfeld modules

Abstract: We give an effective algorithm to determine the endomorphism ring of a Drinfeld module, both over its field of definition and over a separable or algebraic closure thereof. Using previous results we deduce an effective description of the image of the adelic Galois representation associated to the Drinfeld module, up to commensurability. We also give an effective algorithm to decide whether two Drinfeld modules are isogenous, again both over their field of definition and over a separable or algebraic closure th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
4
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(4 citation statements)
references
References 15 publications
0
4
0
Order By: Relevance
“…Remark 3.4. In [15], Kuhn and Pink gave a different algorithm for computing End k (φ). They work in the most general setting where A is a finitely generated normal integral domain of transcendence degree 1 over a finite field F q , k is an arbitrary finitely generated field, and no restrictions on D are imposed.…”
Section: Next Compute the Index χ(B/a[π]mentioning
confidence: 99%
See 3 more Smart Citations
“…Remark 3.4. In [15], Kuhn and Pink gave a different algorithm for computing End k (φ). They work in the most general setting where A is a finitely generated normal integral domain of transcendence degree 1 over a finite field F q , k is an arbitrary finitely generated field, and no restrictions on D are imposed.…”
Section: Next Compute the Index χ(B/a[π]mentioning
confidence: 99%
“…They work in the most general setting where A is a finitely generated normal integral domain of transcendence degree 1 over a finite field F q , k is an arbitrary finitely generated field, and no restrictions on D are imposed. On the other hand, the emphasis of [15] is on the existence of a deterministic algorithm that computes End k (φ) rather that its practicality, so some of the details of the algorithm are left out.…”
Section: Next Compute the Index χ(B/a[π]mentioning
confidence: 99%
See 2 more Smart Citations