f-vector and h-vector
Builds on Simplicial complexBinomial coefficient
Definition
Let be a finite simplicial complex of dimension , with . For , let be the number of faces of of dimension , that is, with vertices; so counts the empty face. The f-vector of is . The h-vector of is the sequence defined by
Remarks
Comparing coefficients gives . In particular , , and . The f-vector can be recovered from the h-vector, so both carry the same information. For a simplicial polytope of dimension one uses the f-vector and h-vector of its boundary complex, which has dimension .
Example: the boundary of an octahedron has and . Then , so , and indeed .
Non-example of a nice property: the h-vector can have negative entries. For two disjoint edges, and , and gives .
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Binomial coefficient concept
- Simplicial complex concept
- f-vector and h-vector definition
Further reading
About this page
| Tag | 8DEH72QHEA |
|---|---|
| URI | m2://8DEH72QHEA |
| Kind | definition |
| Writing | W0 stub |
| MSC | 05E45, 52B05 |
| Defines | f-vector and h-vector |
| Uses | Simplicial complex, Binomial coefficient |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.