Go backward to 33 f-Vector of Simplicial Complexes
Go up to 7 Beyond Polytopes
Go forward to 35 Shellability
|
Go backward to 33 f-Vector of Simplicial Complexes Go up to 7 Beyond Polytopes Go forward to 35 Shellability |
XHTML 1.0 |
| Input: | Finite abstract simplicial complex Δ given by a list of facets, i ∈ N |
|---|---|
| Output: | The i-th homology group of Δ, given by its rank and its torsion coefficients |
| Status (general): | Open |
|---|---|
| Status (fixed dim.): | Polynomial time |
| There exists a polynomial time algorithm if Δ is given by the list of all simplices, since the Smith normal form of an integer matrix can be computed efficiently (Iliopoulos [31]). For fixed i or dim(Δ) - i, the sizes of the boundary matrices are polynomial in the size of Δ and the Smith normal form can again be computed efficiently. |
| Related problems: | 32, 33 |
|---|
|
|
Why are some symbols not displayed correctly? |