Vertex-Minimal Triangulation of Complexes with Homology
Abstract
For a given pair of numbers (d,k), we establish the minimal number of vertices in pure d-dimensional simplicial complexes with non-trivial homology in dimension k. Furthermore, we solve the problem under the additional constraint of strong connectivity with respect to any intermediate dimension.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.