Related papers: Factoring Polynomials over Finite Fields with Line…

We study the arithmetic and geometric iterated monodromy groups associated to the postcritically finite (PCF) quadratic rational function $f(x)=\frac{2}{(x-1)^2}$ defined over a number field $k$, whose critical points are both strictly…

In this paper, we study the hardness of solving graph-structured linear systems with coefficients over a finite field $\mathbb{Z}_p$ and over a polynomial ring $\mathbb{F}[x_1,\ldots,x_t]$. We reduce solving general linear systems in…

We compute new polynomials with Galois group $M_{11}$ over $\mathbb{Q}(t)$. These polynomials stem from various families of covers of $\mathbb{P}^1\mathbb{C}$ ramified over at least 4 points. Each of these families has features that make a…

In the process of computing the Galois group of a prime degree polynomial $f(x)$ over $\mathbb Q$ we suggest a preliminary checking for the existence of non-real roots. If $f(x)$ has non-real roots, then combining a 1871 result of Jordan…

We present a geometric setting for the differential Galois theory of $G$-invariant connections with parameters. As an application of some classical results on differential algebraic groups and Lie algebra bundles, we see that the Galois…

In positive characteristic, nearly all Picard-Vessiot extensions are inseparable over some intermediate iterative differential extensions. In the Galois correspondence, these intermediate fields correspond to nonreduced subgroup schemes of…

In this paper we give an algorithm to determine all finite matrix groups over a number field. Our algorithm is based on the representation theory of finite groups.

The solutions of the equation $f^{(p-1)} + f^p = h^p$ in the unknown function $f $over an algebraic function field of characteristic $p$ are very closely linked to the structure and factorisations of linear differential operators with…

We present a polynomial-time pseudo-deterministic algorithm for constructing irreducible polynomial of degree $d$ over finite field $\mathbb{F}_q$. A pseudo-deterministic algorithm is allowed to use randomness, but with high probability it…

The article provides a sufficient condition for a locally finite module over the absolute Galois group of a finite field F to satisfy the Riemann Hypothesis Analogue with respect to the projective line. The condition holds for all smooth…

In this manuscript, we apply patching methods to give a positive answer to the inverse differential Galois problem over function fields over Laurent series fields of characteristic zero. More precisely, we show that any linear algebraic…

We present a novel randomized algorithm to factor polynomials over a finite field $\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo…

We establish that any finite extension of function fields of genus greater than 1 whose relative class group is trivial is Galois and cyclic. This depends on a result from a preceding paper which establishes a finite list of possible Weil…

Motivated by developing algorithms that decide hypertranscendence of solutions of extensions of the Bessel differential equation, algorithms computing the unipotent radical of a parameterized differential Galois group have been recently…

For a polynomial $f = x_1^n + \dots + x_N^n$ let $G_f$ be the non--abelian maximal group of symmetries of $f$. This is a group generated by all $g \in \mathrm{GL}(N,\mathbb{C})$, rescaling and permuting the variables, so that $f(\mathbf{x})…

Let $k$ be a finite field, and $L$ be a $q$-linearized polynomial defined over $k$ of $q$-degree $r$ ($L=\sum^r_{i=0}a_iZ^{q^i}$, with $a_i\in k$). This paper provides an algorithm to compute a characteristic polynomial of $L$ over a large…

Let $\epsilon>0$. In this article we will present a deterministic algorithm which does the following. The input is a hyperelliptic curve $C$ of genus $g$ over a finite field $k$ of cardinality $q$ given by $y^2+h(x)y=f(x)$ such that the…

This paper introduces a natural extension of Kolchin's differential Galois theory to positive characteristic iterative differential fields, generalizing to the non-linear case the iterative Picard-Vessiot theory recently developed by Matzat…

The paper is concerned with the following version of Hilbert's irreducibility theorem: if $\pi: X \to Y$ is a Galois $G$-covering of varieties over a number field $k$ and $H \subset G$ is a subgroup, then for all sufficiently large and…

In this paper we show a new way of constructing deterministic polynomial-time approximation algorithms for computing complex-valued evaluations of a large class of graph polynomials on bounded degree graphs. In particular, our approach…