Related papers: Computing Galois groups of Fano problems
A Fano problem is an enumerative problem of counting $r$-dimensional linear subspaces on a complete intersection in $\mathbb{P}^n$ over a field of arbitrary characteristic, whenever the corresponding Fano scheme is finite. A classical…
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…
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…
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 apply the differential Galois theory for difference equations developed by Hardouin and Singer to compute the differential Galois group for a second-order linear $q$-difference equation with rational function coefficients. This Galois…
As Jordan observed in 1870, just as univariate polynomials have Galois groups, so do problems in enumerative geometry. Despite this pedigree, the study of Galois groups in enumerative geometry was dormant for a century, with a systematic…
Jordan showed that the incidence variety of a smooth cubic surface containing 27 lines has solvable Galois group over the incidence variety of a smooth cubic surface containing 3 skew lines. As noted by Harris, it follows that for any…
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 complexity of computing the Galois group of a linear differential equation is of general interest. In a recent work, Feng gave the first degree bound on Hrushovski's algorithm for computing the Galois group of a linear differential…
We present an algorithm that determines the Galois group of linear difference equations with rational function coefficients.
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…
We show how the size of the Galois groups of iterates of a quadratic polynomial $f(x)$ can be parametrized by certain rational points on the curves $C_n:y^2=f^n(x)$ and their quadratic twists. To that end, we study the arithmetic of such…
Curves of low genus on a surface carry important informations on that surface. We study the Fano surfaces of lines of cubic threefolds that contain 12 or 30 elliptic curves. We determine their Picard number and compute a basis of the…
We classify Schubert problems in the Grassmannian of 4-planes in 9-dimensional space by their Galois groups. Of the 31,806 essential Schubert problems in this Grassmannian, there are only 149 whose Galois group does not contain the…
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…
Many well-known graph drawing techniques, including force directed drawings, spectral graph layouts, multidimensional scaling, and circle packings, have algebraic formulations. However, practical methods for producing such drawings…
The inverse problem of Galois Theory was developed in the early 1800 s as an approach to understand polynomials and their roots. The inverse Galois problem states whether any finite group can be realized as a Galois group over Q (field of…
We construct explicit examples of cubic surfaces over $\bbQ$ such that the 27 lines are acted upon by the index two subgroup of the maximal possible Galois group. This is the simple group of order $25 920$. Our examples are given in…
A point on a plane curve is said to be Galois (for the curve) if the projection from the point as a map from the curve to a line induces a Galois extension of function fields. It is known that the number of Galois points is finite except…
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…