Macaulay2 » Documentation
Packages » AbstractSimplicialComplexes :: ambientAbstractSimplicialComplexSize
next | previous | forward | backward | up | index | toc

ambientAbstractSimplicialComplexSize -- the ambient simplex size

Description

If an abstract simplicial complex has vertices supported on a subset of $[n] = \{1,\dots,n\}$, and including $n$, then it seems useful to regard this simplicial complex as being a subsimplicial complex of the simplex on $[n]$. This method simply returns this largest integer $n$.

i1 : K = abstractSimplicialComplex({{1,2},{3}})

o1 = AbstractSimplicialComplex{-1 => {{}}          }
                               0 => {{1}, {2}, {3}}
                               1 => {{1, 2}}

o1 : AbstractSimplicialComplex
i2 : J = ambientAbstractSimplicialComplexSize(K)

o2 = 3

Ways to use ambientAbstractSimplicialComplexSize:

  • ambientAbstractSimplicialComplexSize(AbstractSimplicialComplex)

For the programmer

The object ambientAbstractSimplicialComplexSize is a method function.


The source of this document is in AbstractSimplicialComplexes.m2:756:0.