Numerical computation of Galois groups

The paper has three main applications. The first one is this Hilbert-Grunwald statement. If $f:X\rightarrow \Pp^1$ is a degree $n$ $\Qq$-cover with monodromy group $S_n$ over $\bar\Qq$, and finitely many suitably big primes $p$ are given with partitions $\{d_{p,1},..., d_{p,s_p}\}$ of $n$, there exist infinitely many specializations of $f$ at points $t_0\in \Qq$ that are degree $n$ field extensions with residue degrees $d_{p,1},..., d_{p,s_p}$ at each prescribed prime $p$. Th...

The purpose of this paper is to propose an efficient method to compute the automorphism group of an arbitrary hyperelliptic function field (genus>1) over a given ground field of characteristic >2 as well as over its algebraic extensions.

The main motivation of our work is to create an efficient algorithm that decides hypertranscendence of solutions of linear differential equations, via the parameterized differential and Galois theories. To achieve this, we expand the representation theory of linear differential algebraic groups and develop new algorithms that calculate unipotent radicals of parameterized differential Galois groups for differential equations whose coefficients are rational functions. P. Berman...

We classify the finite primitive permutation groups which have a cyclic subgroup with two orbits. This extends classical topics in permutation group theory, and has arithmetic consequences. By a theorem of C. L. Siegel, affine algebraic curves with infinitely many integral points are parametrized by rational functions whose monodromy groups have this property. We classify the possibilities of these monodromy groups, and give an application to Hilbert's irreducibility theorem.

Differential equations have arithmetic analogues in which derivatives are replaced by Fermat quotients; these analogues are called arithmetic differential equations and the present paper is concerned with the "linear" ones. The equations themselves were introduced in a previous paper. In the present paper we deal with the solutions of these equations as well as with the differential Galois groups attached to the solutions.

The motivation for this paper is to detect when an irreducible projective variety V is not toric. We do this by analyzing a Lie group and a Lie algebra associated to V. If the dimension of V is strictly less than the dimension of the above mentioned objects, then V is not a toric variety. We provide an algorithm to compute the Lie algebra of an irreducible variety and use it to provide examples of non-toric statistical models in algebraic statistics.

Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we review several applications and discuss implementation and computational aspects.

For many finite groups, the Inverse Galois Problem can be approached through modular/automorphic Galois representations. This is a report explaining the basic strategy, ideas and methods behind some recent results. It focusses mostly on the 2-dimensional case and underlines in particular the importance of understanding coefficient fields.

We prove that the monodromy group of a reduced irreducible square system of general polynomial equations equals the symmetric group. This is a natural first step towards the Galois theory of general systems of polynomial equations, because arbitrary systems split into reduced irreducible ones upon monomial changes of variables. In particular, our result proves the multivariate version of the Abel--Ruffini theorem: the classification of general systems of equations solvable ...

In this paper we discuss applications of our earlier work in studying certain Galois groups and splitting fields of rational functions in $\mathbb Q\left(X_0(N)\right)$ using Hilbert's irreducibility theorem and modular forms. We also consider computational aspect of the problem using MAGMA and SAGE.