Related papers: Drinfeld Modules with Complex Multiplication, Hass…

Let $q$ be an odd prime power, $a \in \mathbb{F}_q[T]$ and $u \in \mathbb{F}_q^*$. Provided $q \geq 17$, we compute the average number of primes $p$ for which the characteristic polynomial of the Frobenius at $p$ is $X^2 - aX + up$ over a…

The joint moments of the derivatives of the characteristic polynomial of a random unitary matrix, and also a variant of the characteristic polynomial that is real on the unit circle, in the large matrix size limit, have been studied…

We consider the problem of identity testing and recovering (that is, interpolating) of a "hidden" monic polynomials $f$, given an oracle access to $f(x)^e$ for $x\in\mathbb F_q$, where $\mathbb F_q$ is the finite field of $q$ elements and…

We establish a connection between Drinfeld modules and rank-metric codes, focusing on the case of semifield codes. Our method constructs rank-metric codes from linear subspaces of endomorphisms of a Drinfeld module acting on torsion…

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…

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…

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…

We present a recursive minimal polynomial theorem for finite sequences over a commutative integral domain $D$. This theorem is relative to any element of $D$. The ingredients are: the arithmetic of Laurent polynomials over $D$, a recursive…

Invariant inference algorithms such as interpolation-based inference and IC3/PDR show that it is feasible, in practice, to find inductive invariants for many interesting systems, but non-trivial upper bounds on the computational complexity…

For any rank 2 Drinfeld module rho defined over an algebraic function field, we consider its period matrix P, which is analogous to the period matrix of an elliptic curve defined over a number field. Suppose that the characteristic of F_q…

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 formulate and prove a log-algebraicity theorem for arbitrary rank Drinfeld modules defined over the polynomial ring F_q[theta]. This generalizes results of Anderson for the rank one case. As an application we show that certain special…

We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…

Let ${\mathsf F}$ be the Schur functor from the category of finite dimensional ${\mathcal H}_{\vartriangle}(r)_\mathbb C$-modules to the category of finite dimensional ${\mathcal S}_{\vartriangle}(n,r)_{\mathbb{C}}$-modules, where…

This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only…

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…

We consider generalized Haagerup categories such that $1 \oplus X$ admits a $Q$-system for every non-invertible simple object $X$. We show that in such a category, the group of order two invertible objects has size at most four. We describe…

Given a zero-dimensional ideal I in K[x1,...,xn] of degree D, the transformation of the ordering of its Groebner basis from DRL to LEX is a key step in polynomial system solving and turns out to be the bottleneck of the whole solving…

We give an new arithmetic algorithm to compute the generalized Discrete Fourier Transform (DFT) over finite groups $G$. The new algorithm uses $O(|G|^{\omega/2 + o(1)})$ operations to compute the generalized DFT over finite groups of Lie…

We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time--space complexity is roughly quadratic in the logarithm of the…