We present some new properties of triangular sets, which have rather theoretical contribution to understand the structure of the affine varieties of triangular sets. Based on these results and the famous algorithm CharSet, we present two modified versions of the algorithm CharSer that can decompose any nonempty polynomial set into characteristic series. Some examples show that our improvement can efficiently avoid for redundant decompositions, and reduce the branches of the decomposition tree at times. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Li, Y. B. (2006). Some properties of triangular sets and improvement upon algorithm CharSer. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4120 LNAI, pp. 82–93). Springer Verlag. https://doi.org/10.1007/11856290_9
Mendeley helps you to discover research relevant for your work.