Related papers: Factoring Polynomials over Finite Fields using Dri…
An additive fast Fourier transform over a finite field of characteristic two efficiently evaluates polynomials at every element of an $\mathbb{F}_2$-linear subspace of the field. We view these transforms as performing a change of basis from…
The purpose of this paper is to compute the Drinfel'd polynomials for two types of evaluation representations of quantum affine algebras at roots of unity and construct those representations as the submodules of evaluation Schnizer modules.…
We present a new approach to calculating the higher Frobenius-Schur indicators for the simple modules over the Drinfeld double of a finite group. In contrast to the formula by Kashina-Sommerh{\"a}user-Zhu that involves a sum over all group…
We demonstrate that a modification of the classical index calculus algorithm can be used to factor integers. More generally, we reduce the factoring problem to finding an overdetermined system of multiplicative relations in any factor base…
Let q be a prime power and E a non-isotrivial elliptic curve over Fq(T) given by a Weierstrass model. We survey the construction, with an explicit point of view, of the modular parametrization of E by the associated Drinfeld modular curve.…
Triangular decomposition is a classic, widely used and well-developed way to represent algebraic varieties with many applications. In particular, there exist sharp degree bounds for a single triangular set in terms of intrinsic data of the…
Multiplication of polynomials is among key operations in computer algebra which plays important roles in developing techniques for other commonly used polynomial operations such as division, evaluation/interpolation, and factorization. In…
A special Infeld-Hall factorization is given for the Askey-Wilson second order q-difference operator. It is then shown how to deducd a generalization of the corresponding Askey-Wilson polynomials.
We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…
We prove a stabilization result for the $\mathbb{F}_q$-dimension of spaces of morphisms between supersingular Drinfeld modules, filtered by degree: for any two supersingular rank-$2$ Drinfeld $\mathbb{F}_q[T]$-modules in characteristic…
In [Tha15], we looked at two (`multiplicative' and `Carlitz-Drinfeld additive') analogs each, for the well-known basic congruences of Fermat and Wilson, in the case of polynomials over finite fields. When we look at them modulo higher…
The Fast Fourier Transform (FFT) over a finite field $\mathbb{F}_q$ computes evaluations of a given polynomial of degree less than $n$ at a specifically chosen set of $n$ distinct evaluation points in $\mathbb{F}_q$. If $q$ or $q-1$ is a…
Let ${\mathbb F}_q$ be a finite field of characteristic two and ${\mathbb F}_q(X_1,...,X_n)$ a rational function field. We use matrix methods to obtain explicit transcendental bases of the invariant subfields of orthogonal groups and…
We present a generalization of a polynomial factorization algorithm that works with ideals in maximal orders of global function fields. The method presented in this paper is intrinsic in the sense that it does not depend on the embedding of…
Following our first article, we continue to investigate ultrametic modules over a ring of twisted polynomials of the form $[K;\vfi]$, where $\vfi$ is a ring endomorphism of $K$. The main motivation comes from the the theory of valued…
We present an algorithm for computing discriminants and prime ideal decomposition in number fields. The algorithm is a refinement of a p-adic factorization method based on Newton polygons of higher order. The running-time and memory…
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…
An efficient evaluation method is described for polynomials in finite fields. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is large enough. Applications to the syndrome computation…
In this paper, we present a new method for computing bounded-degree factors of lacunary multivariate polynomials. In particular for polynomials over number fields, we give a new algorithm that takes as input a multivariate polynomial f in…
We study the family of irreducible modules for quantum affine $\lie{sl}_{n+1}$ whose Drinfeld polynomials are supported on just one node of the Dynkin diagram. We identify all the prime modules in this family and prove a unique…