Numerical computation of Galois groups

DOI10.1007/S10208-017-9356-XzbMATH Open1442.14186arXiv1605.07806OpenAlexW2963295467MaRDI QIDQ667643FDOQ667643

Authors: Jonathan D. Hauenstein, Jose Israel Rodriguez, Frank Sottile 

Publication date: 1 March 2019

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1605.07806

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

zbMATH Keywords

Galois grouphomotopy continuationmonodromypolynomial systemnumerical algebraic geometryfiber product

Mathematics Subject Classification ID

Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Geometric aspects of numerical algebraic geometry (14Q65) Numerical algebraic geometry (65H14)

Cites Work

• Singularities and topology of hypersurfaces
• Data-discriminants of likelihood equations
• Numerically solving polynomial systems with Bertini
• Title not available (Why is that?)
• Software for numerical algebraic geometry: a paradigm and progress towards its implementation
• A congruence modulo four in real Schubert calculus
• Title not available (Why is that?)
• A congruence modulo four for real Schubert calculus with isotropic flags
• Counting critical formations on a line
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• Maximum likelihood for matrices with rank constraints
• Solving the likelihood equations
• Likelihood geometry
• Galois groups of Schubert problems via homotopy computation
• Experimentation and Conjectures in the Real Schubert Calculus for Flag Manifolds
• An a posteriori certification algorithm for Newton homotopies
• Experimentation in the Schubert calculus
• Adaptive Multiprecision Path Tracking
• Witness sets of projections
• Schubert induction
• Title not available (Why is that?)
• Title not available (Why is that?)
• Calcul de résolvantes avec les modules de Cauchy
• Intersection matrices for finite permutation groups
• Maximum likelihood duality for determinantal varieties
• Introduction to numerical algebraic geometry
• Exceptional sets and fiber products
• Galois groups of enumerative problems
• Computing monodromy via continuation methods on random Riemann surfaces
• A theorem on the Poincaré group of an algebraic hypersurface
• Double transitivity of Galois groups in Schubert calculus of Grassmannians
• Galois groups of Schubert problems of lines are at least alternating

Cited In (17)

• A numerical transcendental method in algebraic geometry: computation of Picard groups and related invariants
• Galois groups of Schubert problems via homotopy computation
• Landau discriminants
• Minimal Problems for the Calibrated Trifocal Variety
• Comments on ‘the group velocity of some numerical schemes’
• Using monodromy to recover symmetries of polynomial systems
• Galois/Monodromy Groups for Decomposing Minimal Problems in 3D Reconstruction
• Varieties of planes on intersections of three quadrics
• Monodromy coordinates
• Classification of Schubert Galois groups in \(Gr(4, 9)\)
• Real monodromy action
• Gibbs manifolds
• Computation of Galois groups in Magma
• ANTS XIII. Proceedings of the thirteenth algorithmic number theory symposium, University of Wisconsin-Madison, WI, USA, July 16--20, 2018
• Computing invariants via slicing groupoids: Gel'fand MacPherson, Gale and positive characteristic stable maps
• Using monodromy to statistically estimate the number of solutions
• Computing Galois groups of Fano problems

Uses Software

• Macaulay2
• Bertini
• Bertini.m2

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)