Related papers: Drinfeld Modules with Complex Multiplication, Hass…
In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise…
Generalized Heisenberg algebras $\H(f)$ for any polynomial $f(h)\in\C[h]$ have been used to explain various physical systems and many physical phenomena for the last 20 years. In this paper, we first obtain the center of $\H(f)$, and the…
Given a "black box" function to evaluate an unknown rational polynomial f in Q[x] at points modulo a prime p, we exhibit algorithms to compute the representation of the polynomial in the sparsest shifted power basis. That is, we determine…
Following several decades of successive algorithmic improvements, works from the 2010s have showed how to compute the Hermite normal form (HNF) of a univariate polynomial matrix within a complexity bound which is essentially that of…
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…
We introduce a new class of Frank-Wolfe algorithms for minimizing differentiable functionals over probability measures. This framework can be shown to encompass a diverse range of tasks in areas such as artificial intelligence,…
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…
Let $f(T)$ be a monic polynomial of degree $d$ with coefficients in a finite field $\mathbb{F}_q$. Extending earlier results in the literature, but now allowing $(q,2d)>1$, we give a criterion for $f$ to satisfy the following property: for…
In this paper, we study the tensor structure of category of finite dimensional representations of Drinfeld quantum doubles $D(H_n(q))$ of Taft Hopf algebras $H_n(q)$. Tensor product decomposition rules for all finite dimensional…
In this paper the rigid cohomology of Drinfeld's upper half space over a finite field is computed in two ways. The first method proceeds by computation of the rigid cohomology of the complement of Drinfeld's upper half space in the ambient…
Elaborating on ideas of Elkies, we show how recursive equations for towers of Drinfeld modular curves $(X_0(P^n))_{n\ge 0}$ for $P\in \mathbb F_q[T]$ can be read of directly from the modular polynomial $\Phi_P(X,Y)$ and how this naturally…
We compute the first and second moments of the divisor-counting function for the Euler-Poincar\'{e} characteristic and the trace of Frobenius for the reductions modulo $p$ of a rank 2 Drinfeld module with nontrivial endomorphism ring, as…
We propose a new lifting and recombination scheme for rational bivariate polynomial factorization that takes advantage of the Newton polytope geometry. We obtain a deterministic algorithm that can be seen as a sparse version of an algorithm…
In this paper we generalize the classical Groebner basis technique to prove the existence and present a method of computation of a dimension polynomial in two variables associated with a finitely generated D-module, that is, a finitely…
We present a new algorithm for computing a $\mu$-basis of the syzygy module of $n$ polynomials in one variable over an arbitrary field $\mathbb{K}$. The algorithm is conceptually different from the previously-developed algorithms by Cox,…
We introduce certain special polynomials in an arbitrary number of indeterminates over a finite field. These polynomials generalize the special polynomials associated to the Goss zeta function and Goss-Dirichlet $L$-functions over the ring…
We find a new approach to computing the remainder of a polynomial modulo $x^n-1$; such a computation is called modular enumeration. Given a polynomial with coefficients from a commutative $\mathbb{Q}$-algebra, our first main result…
We study the supremum of some random Dirichlet polynomials and obtain sharp upper and lower bounds for supremum expectation that extend the optimal estimate of Hal\'asz-Queff\'elec and enable to cunstruct random polynomials with unusually…
Studying the factorization theory of numerical monoids relies on understanding several important factorization invariants, including length sets, delta sets, and $\omega$-primality. While progress in this field has been accelerated by the…
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…