Computing submodules of points of general Drinfeld modules over finite fields
Abstract
We present an algorithm for computing the structure of any submodule of the module of points of a Drinfeld $A$-module over a finite field, where $A$ is a function ring over $\mathbb F_q$. When the function ring is $A = \mathbb F_q[T]$, we additionally compute a Frobenius decomposition of said submodule. Our algorithms apply in particular to kernels of isogenies and torsion submodules. They are presented within the frameworks of Frobenius normal forms, presentations of modules, and Fitting ideals. They rely largely on efficient and classical linear algebra methods, combined with fast arithmetic of Ore polynomials. We analyze the complexity of our algorithms, explore optimizations, and provide an implementation in SageMath. Finally, we compute a simple invariant attached to a Drinfeld $\mathbb F_q[T]$-module that encodes all the polynomials in $\mathbb F_q[T]$ whose associated torsion is rational.
Growth and citations
This paper is currently showing No growth state computed yet..
Citation metrics and growth state from academic sources (e.g. Semantic Scholar). See About for details.
Cited by (0)
No citing papers yet
Papers that cite this one will appear here once data is available.
View citations page →References (0)
No references in DB yet
References for this paper will appear here once ingested.
Related papers in Number Theory
- Fel's Conjecture on Syzygies of Numerical Semigroups0 citations
- The largest prime factor of an irreducible cubic polynomial0 citations
- Parity of $k$-differentials in genus zero and one0 citations
Growth transitions
No transitions recorded yet
Growth state transitions will appear here once computed.