Numerical computation of Galois groups

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 the roots of a complex polynomial $f(x) = c_0 + c_1 x^{d_1} + \ldots + c_k x^{d_k}$ by varying its coefficients. If the GCD of the exponents is $d$, then the polynomial admits the change of variable $y=x^d$, and its roots split into necklaces...

We present new computational results for symplectic monodromy groups of hypergeometric differential equations. In particular, we compute the arithmetic closure of each group, sometimes justifying arithmeticity. The results are obtained by extending our previous algorithms for Zariski dense groups, based on the strong approximation and congruence subgroup properties.

Group theory is a particularly fertile field for the design of practical algorithms. Algorithms have been developed across the various branches of the subject and they find wide application. Because of its relative maturity, computational group theory may be used to gain insight into the general structure of algebraic algorithms. This paper examines the basic ideas behind some of the more important algorithms for finitely presented groups and permutation groups, and surveys r...

In this article we present a new method to obtain polynomial lower bounds for Galois orbits of torsion points of one dimensional group varieties.

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 sufficiently divisible $n$ there exist a degree $n$ closed point $y \in |Y|$ and $x \in \pi^{-1}(y)$ for which $k(x)/k(y)$ is a Galois $H$-extension, and $k(y)/k$ is an $S_n$-extension. The result has interesting corollaries when applied to mod...

A method of constructing algebraic-geometric codes with many automorphisms arising from Galois points for algebraic curves is presented.

We study methods for finding the solution set of a generic system in a family of polynomial systems with parametric coefficients. We present a framework for describing monodromy based solvers in terms of decorated graphs. Under the theoretical assumption that monodromy actions are generated uniformly, we show that the expected number of homotopy paths tracked by an algorithm following this framework is linear in the number of solutions. We demonstrate that our software implem...

This is an essay to accompany the author's lecture at the introductory workshop on `Nonabelian fundamental groups in arithmetic geometry' at the Newton Institute, Cambridge in July, 2009.

This is an expanded version of the 10 lectures given as the 2006 London Mathematical Society Invited Lecture Series at the Heriot-Watt University 31 July - 4 August 2006.

This is the first in a series of two papers that study monogenicity of number rings from a moduli-theoretic perspective. Given an extension of algebras $B/A$, when is $B$ generated by a single element $\theta \in B$ over $A$? In this paper, we show there is a scheme $\mathcal{M}_{B/A}$ parameterizing the choice of a generator $\theta \in B$, a "moduli space" of generators. This scheme relates naturally to Hilbert schemes and configuration spaces. We give explicit equations an...