Macaulay2 » Documentation
Packages » SimplicialComplexes :: SimplicialComplex
next | previous | forward | backward | up | index | toc

SimplicialComplex -- the class of all abstract simplicial complexes


An abstract simplicial complex on a finite set is a family of subsets that is closed under taking subsets. The elements in the abstract simplicial complex are called its faces. The faces having cardinality 1 are its vertices and the maximal faces (order by inclusion) are its facets. Following the combinatorial conventions, every nonempty abstract simplicial complex has the empty set as a face.

In this package, a simplicial complex is represented by its Stanley–Reisner ideal. The vertices are identified with a subset of the variables in a polynomial ring and each face is identified with the product of the corresponding variables. A nonface is any subset of the variables that does not belong to the simplicial complex and each nonface is again identified with a product of variables. The Stanley-Reisner ideal of a simplicial complex is generated by monomials corresponding to its nonfaces.

See also

Functions and methods returning an abstract simplicial complex :

Methods that use an abstract simplicial complex :

For the programmer

The object SimplicialComplex is a type, with ancestor classes HashTable < Thing.