Related papers: Factoring Polynomials over Finite Fields using Dri…

We present a FFT-based algorithm for the computation of a polynomial's coefficients from its roots, and apply it to obtain the coefficients of interpolation polynomials, to invert Vandermondians and to evaluate the symmetric functions of a…

Let $k$ be a field containing $\mathbb{F}_q$. Let $\psi$ be a rank $r$ Drinfeld $\mathbb{F}_q[t]$-module determined by $\psi_t(X) = tX+a_1X^q+\cdots+a_{r-1}X^{q^{r-1}}+X^{q^r}$, where $t,a_1,\ldots,a_{r-1}$ are algebraically independent…

A braided tensor category $FM_{\kappa}$ of `factorizable D-modules' over configuration spaces is introduced, analogous to the category $FS_q$ of factorizable sheaves from q-alg/9604001. This category is equivalent to the category of finite…

Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…

In this paper we characterize the set of polynomials $f\in\mathbb F_q[X]$ satisfying the following property: there exists a positive integer $d$ such that for any positive integer $\ell$ less or equal than the degree of $f$, there exists…

We adapt (over $\mathbb{F}_2$) the general notions of multiplicative function, Dirichlet convolution and Inverse. We get some interesting results, namely necessary conditions for an odd binary polynomial to be perfect. Note that we are…

In this paper, we formulate the Drinfeld module analogue of a question raised by Lang and studied by Katz on the existence of rational points on abelian varieties over number fields. Given a maximal ideal $\fl$ of $\F_q[T]$, the question…

We give algorithms for computing the singular moduli of suitable nonholomorphic modular functions F(z). By combining the theory of isogeny volcanoes with a beautiful observation of Masser concerning the nonholomorphic Eisenstein series…

Let K be an algebraic number field of degree d and discriminant D over Q. Let A be an associative algebra over K given by structure constants such that A is isomorphic to the algebra M_n(K) of n by n matrices over K for some positive…

Let $k$ be a locally compact complete field with respect to a discrete valuation $v$. Let $\oo$ be the valuation ring, $\m$ the maximal ideal and $F(x)\in\oo[x]$ a monic separable polynomial of degree $n$. Let $\delta=v(\dsc(F))$. The…

We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic…

We obtain new uniform bounds for the symmetric tensor rank of multiplication in finite extensions of any finite field Fp or Fp2 where p denotes a prime number greater or equal than 5. In this aim, we use the symmetric Chudnovsky-type…

We show that the counts of low degree irreducible factors of a random polynomial $f$ over $\mathbb{F}_q$ with independent but non-uniform coefficients behave like that of a uniform random polynomial, exhibiting a form of universality for…

In this paper a Kummer theory of division points over rank one Drinfeld A=Fq[T]-modules defined over global function fields was given. The results are in complete analogy with the classical Kummer theory of division points over the…

The modular invariant of rank 1 Drinfeld modules is introduced and used to formulate and prove an exact analog of the Weber-Fueter theorem for global function fields. The main ingredient in the proof is a version of Shimura's Main Theorem…

Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…

Additive Fourier Transform is sdudied. A fast multiplication algorithm for polynomials over the binary field is given. The bit complexity of the algorithm is $O(n(log n)(\log\log n)^2)$.

We study the representations of two types of pointed Hopf algebras: restricted two-parameter quantum groups, and the Drinfel'd doubles of rank one pointed Hopf algebras of nilpotent type. We study, in particular, under what conditions a…

Given a non-zero polynomial $f$ in a polynomial ring $R$ with coefficients in a finite field of prime characteristic $p$, we present an algorithm to compute a differential operator $\delta$ which raises $1/f$ to its $p$th power. For some…

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