Photo from archive.org
The Galois/monodromy group of a family of geometric problems or equations is a subtle invariant that encodes the structure of the solutions. We give numerical methods to compute the Galois… Click to show full abstract
The Galois/monodromy group of a family of geometric problems or equations is a subtle invariant that encodes the structure of the solutions. 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 studies 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.
Keywords:
numerical computation;
galois;
group;
galois groups;
computation galois
Journal Title: Foundations of Computational Mathematics
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Foundations of Computational Mathematics
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!