Related papers: Permuting the roots of univariate polynomials whos…

The Galois/monodromy group of a family of geometric problems or equations is a subtle invariant that encodes the structure of the solutions. Computing monodromy permutations using numerical algebraic geometry gives information about the…

Given fields $k \subseteq L$, our results concern one parameter $L$-parametric polynomials over $k$, and their relation to generic polynomials. The former are polynomials $P(T,Y) \in k[T][Y]$ of group $G$ which parametrize all Galois…

The Galois group of a parameterized polynomial system of equations encodes the structure of the solutions. This monodromy group acts on the set of solutions for a general set of parameters, that is, on the fiber of a projection from the…

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…

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…

A cubic Galois polynomial is a cubic polynomial with rational coefficients that defines a cubic Galois field. Its discriminant is a full square and its roots $x_1,x_2,x_3$ (enumerated in some order) are real. There exists (and only one)…

In this paper, the changes of representations of a group are used in order to describe its action as algebraic Galois group of an univariate polynomial on the roots of factors of any Lagrange resolvent. By this way, the Galois group of…

We introduce a new technique to prove connectivity of subsets of covering spaces (so called inductive connectivity), and apply it to Galois theory of problems of enumerative geometry. As a model example, consider the problem of permuting…

We study the distribution of the Galois group of a random $q$-additive polynomial over a rational function field: For $q$ a power of a prime $p$, let $f=X^{q^n}+a_{n-1}X^{q^{n-1}}+\ldots+a_1X^q+a_0X$ be a random polynomial chosen uniformly…

We study the problem of existence of one-parameter, linear families of polynomials of degree n all of whose polynomials have Galois group A_n. The methods we use have a strong geometric flavour.

Let $R$ be a commutative ring, $f \in R[X_1,\ldots,X_k]$ a multivariate polynomial, and $G$ a finite subgroup of the group of units of $R$ satisfying a certain constraint, which always holds if $R$ is a field. Then, we evaluate $\sum…

We present a family of algorithms for computing the Galois group of a polynomial defined over a $p$-adic field. Apart from the "naive" algorithm, these are the first general algorithms for this task. As an application, we compute the Galois…

We investigate some Galois groups of linearized polynomials over fields such as $\mathbb{F}_q(t)$. The space of roots of such a polynomial is a module for its Galois group. We present a realization of the symmetric powers of this module, as…

Let $L(x)$ be any $q$-linearized polynomial with coefficients in $\mathbb{F}_q$, of degree $q^n$. We consider the Galois group of $L(x)+tx$ over $\mathbb{F}_q(t)$, where $t$ is transcendental over $\mathbb{F}_q$. We prove that when $n$ is a…

We develop algorithms to compute the differential Galois group corresponding to a one-parameter family of second order homogeneous ordinary linear differential equations with rational function coefficients. More precisely, we consider…

This work provides a method(an algorithm) for solving the solvable unary algebraic equation $f(x)=0$ ($f(x)\in\mathbb{Q}[x]$) of arbitrary degree and obtaining the exact radical roots. This method requires that we know the Galois group as…

It is shown that for every splitting of a polynomial with noncommutative coefficients into linear factors $(X-a_{k})$ with $a_{k}$'s commuting with coefficients, any cyclic permutation of linear factors gives the same result and all $a_{k}$…

The problem of computing \emph{the exponent lattice} which consists of all the multiplicative relations between the roots of a univariate polynomial has drawn much attention in the field of computer algebra. As is known, almost all…

For a fixed prime power $q$ and natural number $d$ we consider a random polynomial $$f=x^n+a_{n-1}(t)x^{n-1}+\ldots+a_1(t)x+a_0(t)\in\mathbb F_q[t][x]$$ with $a_i$ drawn uniformly and independently at random from the set of all polynomials…

We develop a Galois theory for systems of linear difference equations with periodic parameters, for which we also introduce linear difference algebraic groups. We then apply this to constructively test if solutions of linear q-difference…