431 research outputs found
Galois groups of Schubert problems via homotopy computation
Numerical homotopy continuation of solutions to polynomial equations is the
foundation for numerical algebraic geometry, whose development has been driven
by applications of mathematics. We use numerical homotopy continuation to
investigate the problem in pure mathematics of determining Galois groups in the
Schubert calculus. For example, we show by direct computation that the Galois
group of the Schubert problem of 3-planes in C^8 meeting 15 fixed 5-planes
non-trivially is the full symmetric group S_6006.Comment: 17 pages, 4 figures. 3 references adde
Modernizing PHCpack through phcpy
PHCpack is a large software package for solving systems of polynomial
equations. The executable phc is menu driven and file oriented. This paper
describes the development of phcpy, a Python interface to PHCpack. Instead of
navigating through menus, users of phcpy solve systems in the Python shell or
via scripts. Persistent objects replace intermediate files.Comment: Part of the Proceedings of the 6th European Conference on Python in
Science (EuroSciPy 2013), Pierre de Buyl and Nelle Varoquaux editors, (2014
Gale duality, decoupling, parameter homotopies, and monodromy
2014 Spring.Numerical Algebraic Geometry (NAG) has recently seen significantly increased application among scientists and mathematicians as a tool that can be used to solve nonlinear systems of equations, particularly polynomial systems. With the many recent advances in the field, we can now routinely solve problems that could not have been solved even 10 years ago. We will give an introduction and overview of numerical algebraic geometry and homotopy continuation methods; discuss heuristics for preconditioning fewnomial systems, as well as provide a hybrid symbolic-numerical algorithm for computing the solutions of these types of polynomials and associated software called galeDuality; describe a software module of bertini named paramotopy that is scientific software specifically designed for large-scale parameter homotopy runs; give two examples that are parametric polynomial systems on which the aforementioned software is used; and finally describe two novel algorithms, decoupling and a heuristic that makes use of monodromy
- …