Related papers: Numerical computation of Galois groups

Galois/monodromy groups attached to parametric systems of polynomial equations provide a method for detecting the existence of symmetries in solution sets. Beyond the question of existence, one would like to compute formulas for these…

We consider Galois/monodromy groups arising in computer vision applications, with a view towards building more efficient polynomial solvers. The Galois/monodromy group allows us to decide when a given problem decomposes into algebraic…

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…

The Galois group of a family of cubic surfaces is the monodromy group of the 27 lines of its generic fibre. We describe a method to compute this group for linear systems of cubic surfaces using certified numerical computations. Applying…

Numerical homotopy continuation of solutions to polynomial equations is the foundation for numerical algebraic geometry, whose development has been driven by applications of mathematics. We use numerical homotopy continuation to investigate…

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…

We explore the enumerative problem of finding lines on cubic surfaces defined by symmetric polynomials. We prove that the moduli space of symmetric cubic surfaces is an arithmetic quotient of the complex hyperbolic line, and determine…

We develop a certified numerical algorithm for computing Galois/monodromy groups of parametrized polynomial systems. Our approach employs certified homotopy path tracking to guarantee the correctness of the monodromy action produced by the…

We address two interrelated problems concerning the permutation of roots of univariate polynomials whose coefficients depend on parameters. First, we compute the Galois group of polynomials $\varphi(x)\in\mathbb{C}[y_1,\cdots,y_k][x]$ over…

We study the middle convolution of local systems on the punctured affine line in the setting of singular cohomology and in the setting of \'etale cohomology. We derive a formula to compute the topological monodromy of the middle convolution…

Computational Galois theory, in particular the problem of computing the Galois group of a given polynomial is a very old problem. Currently, the best algorithmic solution is Stauduhar's method. Computationally, one of the key challenges in…

Motivated by applications of algebraic geometry, we introduce the Galois width, a quantity characterizing the complexity of solving algebraic equations in a restricted model of computation allowing only field arithmetic and adjoining…

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…

We compute the Galois groups for a certain class of polynomials over the the field of rational numbers that was introduced by S. Mori and study the monodromy of corresponding hyperelliptic jacobians.

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…

We describe algorithms to compute fixed fields, splitting fields and towers of radical extensions without using polynomial factorisation in towers or constructing any field containing the splitting field, instead extending Galois group…

This is a study of algebras with involution that become isomorphic over a separable closure of the base field to a tensor product of two composition algebras. We classify these algebras, provide criteria for isomorphism and isotopy, and…

We present a Galois theory of parameterized linear differential equations where the Galois groups are linear differential algebraic groups, that is, groups of matrices whose entries are functions of the parameters and satisfy a set of…

This paper introduces a novel approach to understanding Galois theory, one of the foundational areas of algebra, through the lens of machine learning. By analyzing polynomial equations with machine learning techniques, we aim to streamline…

For any simple algebraic group $G$ of exceptional type, we construct geometric $\ell$-adic Galois representations with algebraic monodromy group equal to $G$, in particular producing the first such examples in types $\mathrm{F}_4$ and…