Computing the characteristic polynomial of a finite rank two Drinfeld module

DOI10.1145/3326229.3326256MaRDI QIDQ5121122zbMATH OpenOpenAlexWikidataFDO

Authors Yossef Musleh, Éric Schost

Publication date 10 September 2020

Published in Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1907.12731

zbMATH Keywords

algorithmscomplexityDrinfeld module

Mathematics Subject Classification ID

Drinfel'd modules; higher-dimensional motives, etc. (11G09) Symbolic computation and algebraic computation (68W30)

Abstract: Motivated by finding analogues of elliptic curve point counting techniques, we introduce one deterministic and two new Monte Carlo randomized algorithms to compute the characteristic polynomial of a finite rank-two Drinfeld module. We compare their asymptotic complexity to that of previous algorithms given by Gekeler, Narayanan and Garai-Papikian and discuss their practical behavior. In particular, we find that all three approaches represent either an improvement in complexity or an expansion of the parameter space over which the algorithm may be applied. Some experimental results are also presented.

Recommendations

• Computing modular polynomials and isogenies of rank two Drinfeld modules over finite fields
• Polynomial factorization over finite fields by computing Euler-Poincaré characteristics of Drinfeld modules
• On the evaluation of modular polynomials
• Computing Modular Polynomials
• scientific article; zbMATH DE number 5532114

Cited in

(6)

• Explicit computation of the Drinfeld associator in the case of the fundamental representation of gl(N)
• Computing modular polynomials and isogenies of rank two Drinfeld modules over finite fields
• Computation of the characteristic polynomial of an endomorphism of a free module
• Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology
• Computing a group action from the class field theory of imaginary hyperelliptic function fields
• Algorithms for computing norms and characteristic polynomials on general Drinfeld modules

This page was built for publication: Computing the characteristic polynomial of a finite rank two Drinfeld module

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