A short proof for the parameter continuation theorem

DOI10.1016/j.jsc.2024.102373MaRDI QIDQ6615414

Paul Breiding, Viktoriia Borovik

Publication date: 8 October 2024

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

Gröbner basesdiscriminantspolynomial homotopy continuation

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Computational aspects and applications of commutative rings (13Pxx) Nonlinear algebraic or transcendental equations (65Hxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Hurwitz form of a projective variety
• Coefficient-parameter polynomial continuation
• Comprehensive Gröbner bases
• A new algorithm for discussing Gröbner bases with parameters.
• Canonical comprehensive Gröbner bases
• An efficient method for computing comprehensive Gröbner bases
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Ideals, Varieties, and Algorithms
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• On the complexity of Chow and Hurwitz forms

This page was built for publication: A short proof for the parameter continuation theorem