Related papers: Factoring Polynomials over Finite Fields using Dri…

Given a finite index subfactor, we show that the {\em affine morphisms at zero level} in the affine category over the planar algebra associated to the subfactor is isomorphic to the fusion algebra of the subfactor as a *-algebra. This…

In this paper we introduce a method of characteristic sets with respect to several term orderings for difference-differential polynomials. Using this technique, we obtain a method of computation of multivariate dimension polynomials of…

Following the same framework of the special value results of convolutions of Goss and Pellarin $L$-series attached to Drinfeld modules that take values in Tate algebras by Papanikolas and the author, we establish special value results of…

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…

We exhibit an algorithm to compute the strongest polynomial (or algebraic) invariants that hold at each location of a given affine program (i.e., a program having only non-deterministic (as opposed to conditional) branching and all of whose…

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

Let $D_n(x;a)$ and $E_n(x;a)\in\mathbb F_q[x]$ be Dickson polynomials of first and second kind respectively, where $\mathbb F_q$ is a finite field with $q$ elements. In this article we show explicitly the irreducible factors these…

We reveal a complexity chasm, separating the trinomial and tetranomial cases, for solving univariate sparse polynomial equations over certain local fields. First, for any fixed field $K\in\{\mathbb{Q}_2,\mathbb{Q}_3,\mathbb{Q}_5,\ldots\}$,…

Higher genus partition functions of two-dimensional conformal field theories have to be invariants under linear actions of mapping class groups. We illustrate recent results [4,6] on the construction of such invariants by concrete…

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…

We study partial fraction decompositions (PFDs) in several variables using tools from commutative algebra. We give criteria for when a rational function with poles on a hyperplane arrangement has a desirable PFD. Our criteria are obtained…

We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…

Starting from Rodrigues formula we present a general construction of raising and lowering operators for orthogonal polynomials of continuous and discrete variable on uniform lattice. In order to have these operators mutually adjoint we…

This paper deals with simultaneously fast and in-place algorithms for formulae where the result has to be linearly accumulated: some output variables are also input variables, linked by a linear dependency. Fundamental examples include the…

Factorization machines and polynomial networks are supervised polynomial models based on an efficient low-rank decomposition. We extend these models to the multi-output setting, i.e., for learning vector-valued functions, with application…

Let $A=\mathbb{F}_q[T]$ be the polynomial ring over $\mathbb{F}_q$, and $F$ be the field of fractions of $A$. Let $\phi$ be a Drinfeld $A$-module of rank $r\geq 2$ over $F$. For all but finitely many primes $\mathfrak{p}\lhd A$, one can…

It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial $F \in \mathbb{C}[x]$ of degree $n$ at $n$ complex-valued points can be done with $\tilde{O}(n)$ exact field operations in…

We consider the problem of recovering (that is, interpolating) and identity testing of a "hidden" monic polynomial $f$, given an oracle access to $f(x)^e$ for $x\in{\mathbb F_q}$ (extension fields access is not permitted). The naive…

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…

In this paper we develop techniques that eliminate the need of the Generalized Riemann Hypothesis (GRH) from various (almost all) known results about deterministic polynomial factoring over finite fields. Our main result shows that given a…