|
|
|
|
Numerical Computation of Galois Groups
|
|
|
|
|
|
|
|
نویسنده
|
Hauenstein Jonathan D. ,Rodriguez Jose Israel ,Sottile Frank
|
|
منبع
|
foundations of computational mathematics - 2018 - دوره : 18 - شماره : 4 - صفحه:867 -890
|
|
چکیده
|
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.
|
|
کلیدواژه
|
Galois group ,Monodromy ,Fiber product ,Homotopy continuation ,Numerical algebraic geometry ,Polynomial system ,65H10 ,65H20 ,14Q15
|
|
آدرس
|
University of Notre Dame, Department of Applied and Computational Mathematics and Statistics, USA, University of Chicago, Department of Statistics, USA, Texas A & M University, Department of Mathematics, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|