The GeometricDecomposability package for Macaulay2 (Q6569463)

The article under review introduces the package GeometricDecomposability for Macaulay2. Geometrically vertex decomposable ideals are defined recursively, that is, to check if an ideal is vertex decomposable one has to find a variable with respect to which the ideal is geometrically vertex decomposable, and then check if the contractions of the ideals appearing in the decomposition with respect to that variable are also geometrically vertex decomposable.\N\NThe main function provided by the package is oneStepGVD, which checks if a given ideal I has a geometric vertex decomposition with respect to a given variable y. Relying on this function, the package also provides the functions findOneStepGVD (gives all the variables with respect to which I has a geometric vertex decomposition) and isGVD (returns whether the ideal is geometrically vertex decomposable or not). Since the definition of geometrically vertex decomposable ideals was inspired by the definition of vertex decomposable simplicial complexes, the authors give examples to show the connection of this package with the package SimplicialDecomposability (by considering the Stanley-Reisner ideal of the simplicial complex). The authors also use the package to find graphs whose toric ideal is (weakly) geometrically vertex decomposable.