Finding endomorphisms of Drinfeld modules (Q2055938)

From MaRDI portal
Revision as of 08:51, 27 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finding endomorphisms of Drinfeld modules
scientific article

    Statements

    Finding endomorphisms of Drinfeld modules (English)
    0 references
    0 references
    0 references
    1 December 2021
    0 references
    The authors address the question of wheter, given a Drinfeld \(A\)-module \(\varphi\colon A\to K[\tau]\) over a field \(K\), it is possible effectively to determine its endomorphism ring \(\mathrm{End}_K(\varphi)\), where \(\mathrm{End}_K(\varphi)\) is the subset of elements of \(K[\tau]\) which commute with every \(\varphi_a\), \(a\in A\). For the authors, to answer the question means to solve three things: (1) find a finite set of generators; (2) obtain a finite presentation of \(\mathrm{End}_K(\varphi)\) as an \(A\)-module; (3) express any given element of \(\mathrm{End}_K(\varphi)\) as an \(A\)-linear combination of the generators. The main results of the paper are Theorems 6.8 and 6.9 which determine effectively \(\mathrm{End}_{\bar K}(\varphi)\) and \(\mathrm{End}_K(\varphi)\). The algorithm consists of two parts. One process goes through all non-negative integers \(d\) and finds all endomorphisms of degree \(d\). However, to know that a set is in fact a set of generators requires a second process that tries to prove that the right number of \(A\)-linearly independent elements has been found. This second process uses the Galois representation of the \({\mathfrak p}\)-adic Tate module of \(\varphi\) for a suitable prime \({\mathfrak p}\) of \(A\). For Drinfeld modules of generic characteristic, \(\mathrm{End}_K(\varphi)\) is commutative and the process suffices to determine \(\mathrm{End}_K(\varphi)\) effectively. In special characteristic, the endomorphism ring can be non-commutative and additional technical difficulties arise.
    0 references
    Drinfeld modules
    0 references
    global function fields
    0 references
    computational number theory
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references