Computing monodromy via continuation methods on random Riemann surfaces

DOI10.1016/j.tcs.2010.11.047zbMath1208.14056OpenAlexW2119969459MaRDI QIDQ633630

Adrien Poteaux, Andre Galligo

Publication date: 29 March 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-00657291/file/TCS-galligo-poteaux.pdf

zbMATH Keywords

algorithmsmonodromysymmetric groupplane curvealgebraic geometrycontinuation methodsbivariate polynomialabsolute factorizationMaple coderandom Riemann surface

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational aspects of algebraic curves (14Q05) Polynomials, factorization in commutative rings (13P05) Numerical problems in dynamical systems (65P99)

Related Items (2)

Level crossing in random matrices. II. Random perturbation of a random matrix ⋮ Numerical computation of Galois groups

Uses Software

• Maple

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
• Good reduction of Puiseux series and applications
• A unified method for multivariate polynomial factorizations
• Analysis of approximate factorization algorithm. I
• Limit distribution of small points on algebraic tori
• Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
• Lifting and recombination techniques for absolute factorization
• From an approximate to an exact absolute polynomial factorization
• On the distribution of roots of polynomials
• Towards factoring bivariate approximate polynomials
• Approximate multivariate polynomial factorization based on zero-sum relations
• Continuations and monodromy on random riemann surfaces
• Galois groups of Schubert problems via homotopy computation
• On the cut-off phenomenon for the transitivity of randomly generated subgroups
• Combinatorial group theory, Riemann surfaces and differential equations
• The zeros of random polynomials cluster uniformly near the unit circle
• Factoring Rational Polynomials over the Complex Numbers
• How many zeros of a random polynomial are real?
• Random polynomials with prescribed Newton polytope
• Approximate factorization of multivariate polynomials via differential equations
• Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
• Factoring multivariate polynomials via partial differential equations
• The cutoff phenomenon in finite Markov chains.
• On the Average Number of Real Roots of a Random Algebraic Equation (II)
• Computing Riemann matrices of algebraic curves

This page was built for publication: Computing monodromy via continuation methods on random Riemann surfaces