Using monodromy to recover symmetries of polynomial systems
From MaRDI portal
Publication:6060377
DOI10.1145/3597066.3597106WikidataQ131124333 ScholiaQ131124333MaRDI QIDQ6060377
Tomáš Pajdla, Unnamed Author, Timothy Duff, Margaret H. Regan
Publication date: 3 November 2023
Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Critical points via monodromy and local methods
- Sparse interpolation of multivariate rational functions
- Numerical computation of Galois groups
- HomotopyContinuation.jl: a package for homotopy continuation in Julia
- Robust certified numerical homotopy tracking
- Solving decomposable sparse systems
- Using monodromy to statistically estimate the number of solutions
- Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
- Decomposition of generic multivariate polynomials
- Continuations and monodromy on random riemann surfaces
- Julia: A Fresh Approach to Numerical Computing
- Algorithm 921
- An a posteriori certification algorithm for Newton homotopies
- The Null Space Problem I. Complexity
- On sparse interpolation of rational functions and gcds
- An Approach for Certifying Homotopy Continuation Paths
- Solving polynomial systems via homotopy continuation and monodromy
- Galois/Monodromy Groups for Decomposing Minimal Problems in 3D Reconstruction
- Computing Riemann matrices of algebraic curves
This page was built for publication: Using monodromy to recover symmetries of polynomial systems
