Related papers: Drinfeld Modules with Complex Multiplication, Hass…

The primary objective of this paper is to derive explicit formulas for rank one and rank two Drinfeld modules over a specific domain denoted by A. This domain corresponds to the projective line associated with an infinite place of degree…

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

A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…

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…

This paper provides an algorithmic generalization of Dickson's method of classifying permutation polynomials (PPs) of a given degree $d$ over finite fields. Dickson's idea is to formulate from Hermite's criterion several polynomial…

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…

In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects we call m-schemes. We extend the known conditional deterministic subexponential time polynomial factoring…

Let $\mathbf{K}$ be a field and $\phi$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots,…

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…

We consider the problem of interpolating a sparse multivariate polynomial over a finite field, represented with a black box. Building on the algorithm of Ben-Or and Tiwari for interpolating polynomials over rings with characteristic zero,…

We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists a multiple h in F[x] of f such that h has at most t…

For smooth finite fields $F_q$ (i.e., when $q-1$ factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomial operations, such as multiplication, division,…

We present a polynomial-time pseudo-deterministic algorithm for constructing irreducible polynomial of degree $d$ over finite field $\mathbb{F}_q$. A pseudo-deterministic algorithm is allowed to use randomness, but with high probability it…

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.

We work with detail the Drinfeld module over the ring $$A=F_2[x,y]/(y^2+y=x^3+x+1).$$ The example in question is one of the four examples that come from quadratic imaginary fields with class number $h = 1$ and rank one. We develop specific…

We present a new Monte Carlo algorithm for the interpolation of a straight-line program as a sparse polynomial $f$ over an arbitrary finite field of size $q$. We assume a priori bounds $D$ and $T$ are given on the degree and number of terms…

Let $A={\mathbb F}_q[t]$ be the polynomial ring over a finite field ${\mathbb F}_q$ and let $\phi $ and $\psi$ be $A-$Drinfeld modules. In this paper we consider the group ${\mathrm{Ext}}^1(\phi ,\psi )$ with the Baer addition. We show that…

We study modular polynomials classifying cyclic isogenies between Drinfeld modules of arbitrary rank over the ring F_q[T].

We give asymptotics for the number of Drinfeld $\mathbb{F}_q[T]$-modules over $\mathbb{F}_q(T)$ of a given height, which satisfy prescribed sets of local conditions. This is done by relating our problem to a problem about counting points on…

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…