On computing absolutely irreducible components of algebraic varieties with parameters
DOI10.1007/S00607-010-0099-7zbMATH Open1198.13025OpenAlexW1986685165MaRDI QIDQ5962004FDOQ5962004
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
Recommendations
- On factoring parametric multivariate polynomials
- Complexity of solving parametric polynomial systems
- Complexity bound for the absolute factorization of parametric polynomials
- Counting irreducible components of complex algebraic varieties
- An algorithm for solving zero-dimensional parametric systems of polynomial homogeneous equations
irreducible componentsparametric polynomialspolynomial factorizationalgebraic varieties depending on parameters
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Polynomials in real and complex fields: factorization (12D05)
Cites Work
- Solving zero-dimensional systems through the rational univariate representation
- Computing parametric geometric resolutions
- Sharp estimates for triangular sets
- Title not available (Why is that?)
- A Gröbner free alternative for polynomial system solving
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Gröbner bases and primary decomposition of polynomial ideals
- Vandermonde matrices, NP-completeness and transversal subspaces
- Minimal canonical comprehensive Gröbner systems
- Comprehensive Gröbner bases
- A new algorithm for discussing Gröbner bases with parameters.
- Solving parametric polynomial systems
- Numerical decomposition of the solution sets of polynomial systems into irreducible components
- Title not available (Why is that?)
- Algebraic Geometry. I: Complex projective varieties.
- Definability and fast quantifier elimination in algebraically closed fields
- Solving polynomial equations. Foundations, algorithms, and applications
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Complexity results for triangular sets
- Lower bounds for diophantine approximations
- Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
- Deformation techniques for efficient polynomial equation solving.
- Title not available (Why is that?)
- Effective equidimensional decomposition of affine varieties
- Complexity of the resolution of parametric systems of polynomial equations and inequations
- 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
- Title not available (Why is that?)
- Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
- Title not available (Why is that?)
- Minimal primary decomposition and factorized Gröbner bases
Cited In (6)
- Computational algorithm for reduction type of CM abelian varieties
- Sets of special subvarieties of bounded degree
- On a generalization of Stickelberger's theorem
- Complexity bound for the absolute factorization of parametric polynomials
- On factoring parametric multivariate polynomials
- Effective construction of local parameters of irreducible components of an algebraic variety.
Uses Software
This page was built for publication: On computing absolutely irreducible components of algebraic varieties with parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962004)
