Name
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 package we are developing that relies upon to perform monodromy computations. |
Year | DOI | Venue |
|---|---|---|
2018 | https://doi.org/10.1007/s10208-017-9356-x | Foundations of Computational Mathematics |
Keywords | Field | DocType |
Galois group,Monodromy,Fiber product,Homotopy continuation,Numerical algebraic geometry,Polynomial system,65H10,65H20,14Q15 | Embedding problem,Topology,Algebra,Symmetric group,Resolvent,Mathematical analysis,Monodromy,Permutation group,Galois group,Galois theory,Mathematics,Differential Galois theory | Journal |
Volume | Issue | ISSN |
18 | 4 | 1615-3375 |
Citations | PageRank | References |
2 | 0.46 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jonathan D. Hauenstein | 1 | 269 | 37.65 |
| Jose Israel Rodriguez | 2 | 17 | 6.01 |
| Frank Sottile | 3 | 26 | 5.10 |