Related papers: Galois/monodromy groups for decomposing minimal pr…

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…

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…

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…

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…

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…

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…

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…

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…

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…

In the 80's Aschbacher classified the maximal subgroups of almost all of the finite almost simple classical groups. Essentially, this classification divide these subgroups into two types. The first of these consist roughly of subgroups that…

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…

We study the Galois groups of polynomials arising from a compatible family of representations with big orthogonal monodromy. We show that the Galois groups are usually as large as possible given the constraints imposed on them by a…

In this paper, we propose the first minimal solutions for estimating the semi-generalized homography given a perspective and a generalized camera. The proposed solvers use five 2D-2D image point correspondences induced by a scene plane. One…

In this paper we develop a general method to prove independence of algebraic monodromy groups in compatible systems of representations, and we apply it to deduce independence results for compatible systems both in automorphic and in…

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 address the problem of the determination of the images of three-dimensional geometric and modular Galois representations. In the modular case the existence of these representations is only conjectural. We give conditions to ensure that…

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…

The goal of this paper is to estimate directly the rotation and translation between two stereoscopic images with the help of five homologous points. The methodology presented does not mix the rotation and translation parameters, which is…

Building on lifting results of Ramakrishna, Khare and Ramakrishna proved a purely Galois-theoretic level-raising theorem for two-dimensional odd representations of the Galois group of Q. In this paper, we generalize these techniques from…