Numerical computation of Galois groups
From MaRDI portal
Abstract: 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 group, but can only determine it when it is the full symmetric group. We give numerical methods to compute the Galois group and study it when it is not the full symmetric group. One algorithm computes generators while the other gives information on its structure as a permutation group. We illustrate these algorithms with examples using a Macaulay2 package we are developing that relies upon Bertini to perform monodromy computations.
In this paper, the authors present two numerical methods to compute the Galois group and study it when it is not the full symmetric group. In particular, the first algorithm, the Branch Point Algorithm, computes generators and it has been implemented in Macaulay2 building on monodromy computations performed by Bertini. It is shown its effectiveness in examples ranging from enumerative geometry, kinematics, and statistics. The second algorithm studies the structure of the Galois group as a permutation group using fiber products to test for s-transitivity. This is practical as permutation groups that are not alternating or symmetric are at most 5-transitive. These two algorithms demonstrate that homotopy continuation can be used to compute Galois groups.
Recommendations
- Galois groups of Schubert problems via homotopy computation
- Computation of Galois groups over function fields
- Computation of Galois groups of rational polynomials
- Computation of the Galois group of a polynomial with rational coefficients. II
- Computing the Galois group of a polynomial over a p-adic field
Cites work
- A congruence modulo four for real Schubert calculus with isotropic flags
- A congruence modulo four in real Schubert calculus
- A theorem on the Poincaré group of an algebraic hypersurface
- Adaptive Multiprecision Path Tracking
- An a posteriori certification algorithm for Newton homotopies
- Calcul de résolvantes avec les modules de Cauchy
- Computing monodromy via continuation methods on random Riemann surfaces
- Counting critical formations on a line
- Data-discriminants of likelihood equations
- Double transitivity of Galois groups in Schubert calculus of Grassmannians
- Exceptional sets and fiber products
- Experimentation and Conjectures in the Real Schubert Calculus for Flag Manifolds
- Experimentation in the Schubert calculus
- Galois groups of enumerative problems
- Galois groups of Schubert problems of lines are at least alternating
- Galois groups of Schubert problems via homotopy computation
- scientific article; zbMATH DE number 3717558 (Why is no real title available?)
- scientific article; zbMATH DE number 1261512 (Why is no real title available?)
- scientific article; zbMATH DE number 953044 (Why is no real title available?)
- scientific article; zbMATH DE number 790015 (Why is no real title available?)
- Intersection matrices for finite permutation groups
- Introduction to numerical algebraic geometry
- Likelihood geometry
- Maximum likelihood duality for determinantal varieties
- Maximum likelihood for matrices with rank constraints
- Numerically solving polynomial systems with Bertini
- Schubert induction
- Singularities and topology of hypersurfaces
- Software for numerical algebraic geometry: a paradigm and progress towards its implementation
- Solving the likelihood equations
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Witness sets of projections
Cited in
(23)- Varieties of planes on intersections of three quadrics
- Using monodromy to statistically estimate the number of solutions
- Real monodromy action
- Landau discriminants
- Computing invariants via slicing groupoids: Gel'fand MacPherson, Gale and positive characteristic stable maps
- Computation of Galois groups in Magma
- Galois groups of Schubert problems via homotopy computation
- Exact computations with approximate methods
- Comments on ‘the group velocity of some numerical schemes’
- A numerical transcendental method in algebraic geometry: computation of Picard groups and related invariants
- Minimal Problems for the Calibrated Trifocal Variety
- Galois/Monodromy Groups for Decomposing Minimal Problems in 3D Reconstruction
- Using monodromy to recover symmetries of polynomial systems
- Classification of Schubert Galois groups in \(Gr(4, 9)\)
- Computing Galois groups of Fano problems
- Monodromy coordinates
- Gibbs manifolds
- Solving parameterized polynomial systems with decomposable projections
- On computing local monodromy and the numerical local irreducible decomposition
- Galois groups in enumerative geometry and applications
- Lower bounds for genera of fiber products
- Ramification points of homotopies: enumeration and general theory
- The algebraic matroid of the Heron variety
This page was built for publication: Numerical computation of Galois groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q667643)
