Decomposing algebraic varieties

DOI10.1007/3-540-47997-X_10MaRDI QIDQ4946083zbMATH OpenFDO

Authors Dongming Wang

Publication date 13 September 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-47997-X_10

zbMATH Keywords

Gröbner basisirreducible componentsubresultant regular subchaintriangular set

Mathematics Subject Classification ID

Polynomials, factorization in commutative rings (13P05) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational aspects of higher-dimensional varieties (14Q15) Symbolic computation and algebraic computation (68W30)

Review text

In a previous article [\textit{D. Wang}, Comput. Aided Geom. Des. 9, No. 6, 471-484 (1992; Zbl 0776.14014)], the author studied algorithms for decomposing an algebraic variety into its unmixed or irreducible components by using the method of characteristic sets (and Gröbner bases). Here, the author replaces the characteristic set method in these algorithms by two other elimination methods using triangular sets. One method is based on ideas of Seidenberg and has been developed by the author earlier [\textit{D. Wang}, J. Symb. Comput. 16, No. 2, 83-114 (1993; Zbl 0803.13016)], while the other uses subresultant regular subchains, which the author studied in J. Symb. Comput. 25, No. 3, 295-314 (1998; Zbl 0913.12008). Experimental results are given that show that these new methods are faster than the characteristic set method in most of the examples tested. For the entire collection see [Zbl 0929.00067].

Recommendations

• Irreducible decomposition of algebraic varieties via characteristic sets and Gröbner bases
• Irredundant triangular decomposition
• scientific article; zbMATH DE number 16651
• Effective equidimensional decomposition of affine varieties
• A generalized Euclidean algorithm for computing triangular representations of algebraic varieties

Cited in

(16)

• Algebraic decomposition of regular curves
• Irreducible decomposition of algebraic varieties via characteristic sets and Gröbner bases
• A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
• Decompositions of degenerations
• Effective equidimensional decomposition of affine varieties
• Decomposing polynomial sets simultaneously into Gröbner bases and normal triangular sets
• Decomposing algebraic sets using Gröbner bases
• Decompositions of determinantal varieties
• Relative U-set and its applications to an irreducible decomposition algorithm
• Primary decomposition of zero-dimensional ideals over finite fields
• A Modified Van der Waerden Algorithm to Decompose Algebraic Varieties and Zero-Dimensional Radical Ideals
• scientific article; zbMATH DE number 4104382 (Why is no real title available?)
• scientific article; zbMATH DE number 16651 (Why is no real title available?)
• scientific article; zbMATH DE number 125224 (Why is no real title available?)
• Some Properties of Triangular Sets and Improvement Upon Algorithm CharSer
• Decomposition of algebraic sets and applications to weak centers of cubic systems

This page was built for publication: Decomposing algebraic varieties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4946083)