On computing absolutely irreducible components of algebraic varieties with parameters

DOI10.1007/s00607-010-0099-7zbMath1198.13025MaRDI QIDQ5962004

Ali Ayad

Publication date: 16 September 2010

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-010-0099-7

zbMATH Keywords

polynomial factorization; irreducible components; algebraic varieties depending on parameters; parametric polynomials

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)

12D05: Polynomials in real and complex fields: factorization

Uses Software

• Epsilon
• Kronecker
• ISOLATE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
• Definability and fast quantifier elimination in algebraically closed fields
• Minimal canonical comprehensive Gröbner systems
• Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
• Factorization of polynomials over a finite field and the solution of systems of algebraic equations
• Gröbner bases and primary decomposition of polynomial ideals
• Comprehensive Gröbner bases
• Solving zero-dimensional systems through the rational univariate representation
• Lower bounds for diophantine approximations
• Minimal primary decomposition and factorized Gröbner bases
• Vandermonde matrices, NP-completeness and transversal subspaces
• Computing parametric geometric resolutions
• A new algorithm for discussing Gröbner bases with parameters.
• Effective equidimensional decomposition of affine varieties
• Solving polynomial equations. Foundations, algorithms, and applications
• The complexity of the word problems for commutative semigroups and polynomial ideals
• Complexity results for triangular sets
• Algebraic Geometry. I: Complex projective varieties.
• Deformation techniques for efficient polynomial equation solving.
• Solving parametric polynomial systems
• Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
• Complexity of the resolution of parametric systems of polynomial equations and inequations
• Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
• Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
• Sharp estimates for triangular sets
• A Gröbner free alternative for polynomial system solving