Related papers: Algorithms for computing norms and characteristic …

We present a new algorithm for computing the characteristic polynomial of an arbitrary endomorphism of a finite Drinfeld module using its associated crystalline cohomology. Our approach takes inspiration from Kedlaya's p-adic algorithm for…

Let $\mathbb{F}_q[T]$ be the polynomial ring over a finite field $\mathbb{F}_q$. We study the endomorphism rings of Drinfeld $\mathbb{F}_q[T]$-modules of arbitrary rank over finite fields. We compare the endomorphism rings to their subrings…

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…

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…

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…

We propose and rigorously analyze two randomized algorithms to factor univariate polynomials over finite fields using rank $2$ Drinfeld modules. The first algorithm estimates the degree of an irreducible factor of a polynomial from…

This survey provides a practical and algorithmic perspective on Drinfeld modules over $\mathbb F_q[T]$. Starting with the construction of the Carlitz module, we present Drinfeld modules in any rank and some of their arithmetic properties.…

We give a global description of the Frobenius elements in the division fields of Drinfeld modules of rank $2$. We apply this description to derive a criterion for the splitting modulo primes of a class of non-solvable polynomials, and to…

We present novel algorithms to factor polynomials over a finite field $\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo the polynomial…

We discuss many analogy points with the elliptic curves. more precisely, we study the characteristic polynomial of a Drinfeld module of rank 2 and use it to calculate the number of isogeny classes for such modules.

We present a novel randomized algorithm to factor polynomials over a finite field $\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo…

We give an algorithm to compute representatives of the conjugacy classes of semisimple square integral matrices with given minimal and characteristic polynomials. We also give an algorithm to compute the $\mathbb{F}_q$-isomorphism classes…

Let $\Phi $ be a Drinfeld $\mathbf{F}_{q}[T]$-module of rank 2, over a finite field $L$, a finite extension of $n$ degrees of a finite field with $q$ elements $\mathbf{F}_{q}$. Let $m$ be the extension degrees of $ L$ over the field…

By finite quantum groups we mean Lusztig's finite-dimensional pointed Hopf algebras called quantum Frobenius Kernels [9, 10], and their natural generalizations due to Andruskiewitsch and Schneider [2, 3]. For a Hopf algebra $H$ in a special…

Let $q$ be an odd prime power, $a \in \mathbb{F}_q[T]$ and $u \in \mathbb{F}_q^*$. Provided $q \geq 17$, we compute the average number of primes $p$ for which the characteristic polynomial of the Frobenius at $p$ is $X^2 - aX + up$ over a…

We construct a family of root-finding algorithms which exploit the branched covering structure of a polynomial of degree $d$ with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that…

For a prime $p{\,>\,}3$ and a supersingular elliptic curve $E$ defined over $\mathbb{F}_{p^2}$ with ${j(E)\notin\{0,1728\}}$, consider an endomorphism $\alpha$ of $E$ represented as a composition of $L$ isogenies of degree at most $d$. We…

This is a sequel to the paper [F. Breuer, H.-G. R\"uck, Drinfeld modular polynomials in higher rank, J. Number Theory 129 (2009), 59-83.], in which we introduced Drinfeld modular polynomials of higher rank, using an analytic construction.…

We compute the first and second moments of the divisor-counting function for the Euler-Poincar\'{e} characteristic and the trace of Frobenius for the reductions modulo $p$ of a rank 2 Drinfeld module with nontrivial endomorphism ring, as…

We describe an efficient algorithm which, given a principally polarized (p.p.) abelian surface $A$ over $\mathbb{Q}$ with geometric endomorphism ring equal to $\mathbb{Z}$, computes all the other p.p. abelian surfaces over $\mathbb{Q}$ that…