Related papers: Factoring Polynomials over Finite Fields with Line…

Let $p$ be a prime and $n$ a positive integer. As the first main result, we present a deterministic algorithm for deciding whether the matrix algebra $\mathbb{F}_p[A_1,\dots,A_t]$ with $A_1,\dots,A_t \in \mathrm{GL}(n,\mathbb{F}_p)$ is a…

We develop algorithms to compute the differential Galois group $G$ associated to a parameterized second-order homogeneous linear differential equation of the form \[ \tfrac{\partial^2}{\partial x^2} Y + r_1 \tfrac{\partial}{\partial x} Y +…

We classify all cubic function fields over any finite field, particularly developing a complete Galois theory which includes those cases when the constant field is missing certain roots of unity. In doing so, we find criteria which allow…

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…

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 introduce and study a class of field extensions that we call pre-Galois; viz. extensions that become Galois after some linearly disjoint Galois base change. Among them are geometrically Galois extensions of k(T), with k a field:…

In this work, linearized multivariate skew polynomials over division rings are introduced. Such polynomials are right linear over the corresponding centralizer and generalize linearized polynomial rings over finite fields, group rings or…

Let F be a finitely generated field of characteristic zero and \Gamma<GL_n(F) a finitely generated subgroup. For an element g in \Gamma, let Gal(F(g)/ F) be the Galois group of the splitting field of the characteristic polynomial of g over…

We propose and rigorously analyze two randomized algorithms to factor univariate polynomials over finite fields using rank $2$ Drinfeld modules. The first algorithm estimates the degree of an irreducible factor of a polynomial from…

Given a field $k$ and a finite group $H$, {\it{an $H$-parametric extension over $k$}} is a finite Galois extension of $k(T)$ of Galois group containing $H$ which is regular over $k$ and has all the Galois extensions of $k$ of group $H$…

This paper studies the number of monic integer polynomials $f$ of height at most $H$ whose Galois group, endowed with the action on the roots, is isomorphic to a prescribed permutation group $(G,\Omega)$. New upper bounds are obtained for…

Using the diagrammatic approach to integrals over Gaussian random matrices, we find a representation for polynomial Lie group integrals as infinite sums over certain maps on surfaces. The maps involved satisfy a specific condition: they…

A polynomial time algorithm to give a complete description of all subfields of a given number field was given in an article by van Hoeij et al. This article reports on a massive speedup of this algorithm. This is primary achieved by our new…

Let $\phi$ be a rank $r$ Drinfeld $\BF_q[T]$-module determined by $\phi_T(X) = TX+g_1X^q+...+g_{r-1}X^{q^{r-1}}+X^{q^r}$, where $g_1,...,g_{r-1}$ are algebraically independent over $\BF_q(T)$. Let $N\in\BF_q[T]$ be a polynomial, and…

Given a number field $k$, we show that, for many finite groups $G$, all the Galois extensions of $k$ with Galois group $G$ cannot be obtained by specializing any given finitely many Galois extensions $E/k(T)$ with Galois group $G$ and $E/k$…

We describe a Picard-Vessiot theory for differential fields with non algebraically closed fields of constants. As a technique for constructing and classifying Picard-Vessiot extensions, we develop a Galois descent theory. We utilize this…

We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic…

We present a new algorithm to decompose generic spinor polynomials into linear factors. Spinor polynomials are certain polynomials with coefficients in the geometric algebra of dimension three that parametrize rational conformal motions.…

Let $f(x)$ be a monic polynomial in $\dZ[x]$ with no rational roots but with roots in $\dQ_p$ for all $p$, or equivalently, with roots mod $n$ for all $n$. It is known that $f(x)$ cannot be irreducible but can be a product of two or more…