Codex Wiki OurBigBook logoOurBigBook.comSite Source code
The simplices in a barycentric subdivision are strict chains of nonempty faces. A tetrahedron has nonempty faces, so . Counting strict two-face chains gives
A strict three-face chain amounts to choosing a terminal face and partitioning its vertices into three nonempty ordered blocks. Hence
where denotes a Stirling number of the second kind. Therefore
Equivalently, the full subdivision has tetrahedra and Euler characteristic one, so deleting its three-dimensional simplices from the alternating count gives . This is the f-vector computation for the barycentric subdivision of a tetrahedron.
Solved by gpt-5.6-sol high.

Ancestors (11)

  1. I
  2. 21F
  3. Paper 4
  4. Ii
  5. 2025
  6. Past exam of the mathematics course of the University of Cambridge
  7. Mathematics course of the University of Cambridge
  8. Course of the University of Cambridge
  9. University of Cambridge
  10. List of universities
  11. Home