Related papers: Factoring Polynomials over Finite Fields using Dri…

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 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…

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…

Let $\mathbb{F}_q$ be a finite field with $q$ elements. M. Gerstenhaber and Irving Reiner has given two different methods to show the number of matrices with a given characteristic polynomial. In this talk, we will give another proof for…

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…

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 provide two families of algorithms to compute characteristic polynomials of endomorphisms and norms of isogenies of Drinfeld modules. Our algorithms work for Drinfeld modules of any rank, defined over any base curve. When the base curve…

$\Phi $ be a Drinfeld $\mathbf{F}\_{q}[T]$-module of rank 2, over a finite field $L$. Let $P\_{\Phi}(X)=$ $X^{2}-cX+\mu P^{m}$ ($c$ an element of $\mathbf{F}\_{q}[T],$ $\mu $ be a non-vanishing element of $% \mathbf{F}\_{q}$, $m$ the degree…

Let $\Phi $ be a Drinfeld $\mathbf{F}_{q}[T]$-module of rank 2, over a finite field $L$, a finite extension of $n$ degrees for a finite field with $q$ elements $% \mathbf{F}_{q}$. Let $P_{\Phi}(X)=$ $X^{2}-cX+\mu P^{m}$ ($c$ an element of…

The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.

A notion of Drinfeld polynomials is introduced for modules of two-parameter quantum affine algebras. Finite dimensional representations are then characterized by sets of $l$-tuples of pairs of Drinfeld polynomials with certain conditions.

Let $q$ be an odd number and $q>5$, and $\mathbb{F}_q$ be a finite field of $q$ elements. We prove that at most finitely many singular moduli of rank 2 $\mathbb{F}_q[t]$-Drinfeld modules are algebraic units. In particular, we develop some…

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…

Inspired by the classical setting, Goss defined $L$-series attached to Drinfeld modules. In this paper, for a fixed choice of a power $q$ of a prime number and a given Drinfeld module $\phi$ of rank 2 with a certain condition on its…

Let $p$ be a rational prime and $q$ a power of $p$. Let $\wp$ be a monic irreducible polynomial of degree $d$ in $\mathbf{F}_q[t]$. In this paper, we define an analogue of the Hodge-Tate map which is suitable for the study of Drinfeld…

We obtain explicit upper and lower bounds on the size of the coefficients of the Drinfeld modular polynomials $\Phi_N$ for any monic $N\in\mathbb{F}_q[t]$. These polynomials vanish at pairs of $j$-invariants of Drinfeld…

An algorithm for factoring polynomials over finite fields is given by Berlekamp in 1967. The main tool was the matrix Q corresponding to each polynomial. This paper studies the degrees of polynomials over binary field that associated with…

A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

Lower Bound for the Canonical Height for Drinfeld Modules with Complex Multiplication. Let K be a fi nite extension of Fq(T), let L=K be a Galois extension with Galois group G and let E be the sub eld of L fixed by the center of G. Assume…