Related papers: Factoring Polynomials over Finite Fields using Dri…

To study a Dirichlet polynomial $f(s)=\frac{a_{m}}{m^{s}}+\cdots +\frac{a_{n}}{n^{s}}$ by regarding it as a multivariate polynomial via the canonical map $\phi$ sending $p_i^{-s}$ to an indeterminate $X_i$, with $p_i$ the $i$th prime…

In this article we construct the arithmetic Satake compactification of the Drinfeld moduli schemes of arbitrary rank over the ring of integers of any global function field away from the level structure, and show that the universal family…

Let K be a global field and f in K[X] be a polynomial. We present an efficient algorithm which factors f in polynomial time.

In analogy with the periods of abelian integrals of differentials of third kind for an elliptic curve defined over a number field, we introduce a notion of periods of third kind for a rank 2 Drinfeld Fq[t]-module rho defined over an…

This article deals with the computation of the characteristic polynomial of dense matrices over small finite fields and over the integers. We first present two algorithms for the finite fields: one is based on Krylov iterates and Gaussian…

We introduce formulas for the logarithms of Drinfeld modules using a framework recently developed by the second author. We write the logarithm function as the evaluation under a motivic map of a product of rigid analytic trivializations of…

Let $\mathbb{F}_q$ be the finite field with $q$ elements and consider the rational function field $K:=\mathbb{F}_q(\theta)$. For a Drinfeld module $\phi$ defined over $K$, we study the transcendence of special values of the Goss…

We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), (Gao, 2001) designed a polynomial time algorithm that fails to factor only if the input polynomial…

Constructing $r$-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree $r^e$ (where $r$ is a prime) over a given finite field $\mathbb{F}_q$ of…

The $N$th power of a polynomial matrix of fixed size and degree can be computed by binary powering as fast as multiplying two polynomials of linear degree in~$N$. When Fast Fourier Transform (FFT) is available, the resulting complexity is…

Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…

Drinfeld doubles of finite subgroups of SU(2) and SU(3) are investigated in detail. Their modular data - S, T and fusion matrices - are computed explicitly, and illustrated by means of fusion graphs. This allows us to reexamine certain…

We show a new algorithm and its implementation for multiplying bit-polynomials of large degrees. The algorithm is based on evaluating polynomials at a specific set comprising a natural set for evaluation with additive FFT and a high order…

We propose a lower bound estimate in Dobrowolski's style of the canonical height on a certain family of Drinfeld modules of characteristic 0, including under some hypothesis on their degree and their base field, the complex multiplication…

Let $\mathbb{F}_q$ be the field of $q$ elements and let $A=\mathbb{F}_q[t]$ be the polynomial ring over $\mathbb{F}_q$. Let $\mathfrak{n}\in A\setminus \mathbb{F}_q$ be a monic polynomial with a prime factor of degree prime to $q-1$. Let…

Let $\mathbb{F}_q$ be a finite field with $q$ elements, $f \in \mathbb{F}_q[x_1, \dots, x_n]$ a polynomial in $n$ variables and let us denote by $N(f)$ the number of roots of $f$ in $\mathbb{F}_q^n$. %Many authors, such as Wei Cao and Kung…

We prove that the local height of a point on a Drinfeld module can be computed by averaging the logarithm of the distance to that point over the torsion points of the module. This gives rise to a Drinfeld module analog of a weak version of…

In this paper, we propose two new interpolation algorithms for sparse multivariate polynomials represented by a straight-line program(SLP). Both of our algorithms work over any finite fields $F_q$ with large characteristic. The first one is…

With a fixed prime power $q>1$, define the ring of polynomials $A=\mathbb{F}_q[t]$ and its fraction field $F=\mathbb{F}_q(t)$. For each pair $a=(a_1,a_2) \in A^2$ with $a_2$ nonzero, let $\phi(a)\colon A\to F\{\tau\}$ be the Drinfeld…

We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…