Faster computation of Whitney stratifications and their minimization

From MaRDI portal





The authors describe two new algorithms (A1 and A2) for the computation of Whitney stratifications of real and complex algebraic varieties (defined as the common zeros of \(r\) polynomials in \(n\) variables). A1 is a modification of an algorithm of Helmer and Nanda (AHN), but is made more efficient by using techniques for equidimensional decomposition rather than computing the set of associated primes of a polynomial ideal at a key step in AHN. However A1 may fail to produce a minimal Whitney stratification even when AHN would produce it. A2 coarsens a given Whitney stratification of a complex variety to the unique minimal Whitney stratification; this is referred to as to the minimization of a stratification. The theoretical basis is a classical result of Teissier. The algorithms are applied to 9 examples including the Whitney umbrella.











This page was built for publication: Faster computation of Whitney stratifications and their minimization

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