Generic regular decompositions for generic zero-dimensional systems

DOI10.1007/s11432-013-5057-5zbMath1423.68617arXiv1208.6112OpenAlexW2043491727MaRDI QIDQ2335932

Bican Xia, Xiaoxian Tang, Zhenghong Chen

Publication date: 18 November 2019

Published in: Science China. Information Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.6112

zbMATH Keywords

generic regular decompositionregular-decomposition-unstable varietygeneric zero-dimensional systemparametric triangular decomposition

Mathematics Subject Classification ID

Related Items (1)

Generic regular decompositions for parametric polynomial systems

Uses Software

• Epsilon
• Maple
• PGB
• DISCOVERER

Cites Work

• A complete algorithm for automated discovering of a class of inequality-type theorems
• Elimination methods
• Comprehensive Gröbner bases
• A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
• An elementary approach to subresultants theory.
• Computing triangular systems and regular systems
• On the theories of triangular sets
• A new algorithm for computing comprehensive Gröbner systems
• A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
• Comprehensive Triangular Decomposition
• Automatic Discovery of Geometry Theorems Using Minimal Canonical Comprehensive Gröbner Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generic regular decompositions for generic zero-dimensional systems