A Generalized Euclidean Algorithm for Co
โ
Michael Kalkbrener
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 628 KB
We present an algorithm that computes an unmixed-dimensional decomposition of an arbitrary algebraic variety \(V\). Each \(V_{i}\) in the decomposition \(V=V_{1} \cup \ldots \cup V_{m}\) is given by a finite set of polynomials which represents the generic points of the irreducible components of \(V_