Related papers: Drinfeld Modules with Complex Multiplication, Hass…

In this paper we propose a novel efficient algorithm for calculating winding numbers, aiming at counting the number of roots of a given polynomial in a convex region on the complex plane. This algorithm can be used for counting and…

The fastest known algorithm for factoring a degree $n$ univariate polynomial over a finite field $\mathbb{F}_q$ runs in time $O(n^{3/2 + o(1)}\text{polylog } q)$, and there is a reason to believe that the $3/2$ exponent represents a…

Let $\tilde{f}(X)\in\mathbb{Z}[X]$ be a degree-$n$ polynomial such that $f(X):=\tilde{f}(X)\bmod p$ factorizes into $n$ distinct linear factors over $\mathbb{F}_p$. We study the problem of deterministically factoring $f(X)$ over…

We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions and on interpolation, which has received little attention in…

Let F_q be a finite field with q elements with prime power q and let r>1 be an integer with $q\equiv 1 \pmod{r}$. In this paper, we present a refinement of the Cipolla-Lehmer type algorithm given by H. C. Williams, and subsequently improved…

We give an algorithm to compute representatives of the conjugacy classes of semisimple square integral matrices with given minimal and characteristic polynomials. We also give an algorithm to compute the $\mathbb{F}_q$-isomorphism classes…

Higher-order Fourier analysis, developed over prime fields, has been recently used in different areas of computer science, including list decoding, algorithmic decomposition and testing. We extend the tools of higher-order Fourier analysis…

We establish a fundamental breakthrough in rank-one Drinfeld module arithmetic by deriving explicit formulas over the integral domain $\A = H^{0}(\mathbb{P}^1-P_{\rho}, \mathcal{O}_{\mathbb{P}^1})$, which generalizes the classical…

Numerous algorithms call for computation over the integers modulo a randomly-chosen large prime. In some cases, the quasi-cubic complexity of selecting a random prime can dominate the total running time. We propose a new variant of the…

We continue the study of the Drinfeld double of the Jordan plane, denoted by $\mathcal D$ and introduced in arXiv:2002.02514. The simple finite-dimensional modules were computed in arXiv:2108.13849; it turns out that they factorize through…

This is a sequel to the paper [F. Breuer, H.-G. R\"uck, Drinfeld modular polynomials in higher rank, J. Number Theory 129 (2009), 59-83.], in which we introduced Drinfeld modular polynomials of higher rank, using an analytic construction.…

A new algorithm is presented for computing the largest degree invariant factor of the Sylvester matrix (with respect either to $x$ or $y$) associated to two polynomials $a$ and $b$ in $\mathbb F_q[x,y]$ which have no non-trivial common…

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…

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 give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

Recently, a new polynomial basis over binary extension fields was proposed such that the fast Fourier transform (FFT) over such fields can be computed in the complexity of order $\mathcal{O}(n\lg(n))$, where $n$ is the number of points…

We prove that the groups PSL(r,q^d) can be realized F_q(T)-regularly as Galois groups over the purely transcendental field F_q(T)(t_1,...,t_{r-1}) if r is even and r/2 is coprime to q^d-1. The method is to use twisted moduli schemes of…

We describe an algorithm for the factorization of non-commutative polynomials over a field. The first sketch of this algorithm appeared in an unpublished manuscript (literally hand written notes) by James H. Davenport more than 20 years…

We present a new notion of distribution and derived distribution of rank $r \in \mathbb{N}$ for a global function field $K$ with a distinguished place $\infty$. It allows to describe the relations between division points, isogenies, and…

In the paper it is shown that there exist infinite classes of fast DFT algorithms having multiplicative complexity lower than O(NlogN), i.e. smaller than their arithmetical complexity. The derivation starts with nesting of Discrete Fourier…