GeometricDecomposability : Table of Contents
-
GeometricDecomposability -- a package to check whether ideals are geometrically vertex decomposable
-
CheckCM -- when to perform a Cohen-Macaulay check on the ideal
-
CheckDegenerate -- check whether the geometric vertex decomposition is degenerate
-
CheckUnmixed -- check whether ideals encountered are unmixed
-
CyI -- computes the ideal $C_{y,I}$ for a given ideal and indeterminate
-
findLexCompatiblyGVDOrders -- finds all lexicographic monomial orders $<$ such that the ideal is $<$-compatibly geometrically vertex decomposable
-
findOneStepGVD -- for which indeterminates does there exist a geometric vertex decomposition
-
getGVDIdeal -- computes the $C_{y,I}$ or $N_{y,I}$ ideal at any point in the GVD recursion tree
-
-
isGVD -- checks whether an ideal is geometrically vertex decomposable
-
-
-
isLexCompatiblyGVD -- checks whether an ideal is <-compatibly geometrically vertex decomposable for a given order
-
isUnmixed -- checks whether an ideal is unmixed
-
isWeaklyGVD -- checks whether an ideal is weakly geometrically vertex decomposable
-
NyI -- computes the ideal $N_{y,I}$ for a given ideal and indeterminate
-
oneStepGVD -- computes a geometric vertex decomposition
-
OnlyDegenerate -- restrict to degenerate geometric vertex decompositions
-
-
-
yInit -- computes the ideal of initial y-forms