Face enumeration on simplicial complexes
Abstract
Let M be a closed triangulable manifold, and let be a triangulation of M. What is the smallest number of vertices that can have? How big or small can the number of edges of be as a function of the number of vertices? More generally, what are the possible face numbers (f-numbers, for short) that can have? In other words, what restrictions does the topology of M place on the possible f-numbers of triangulations of M? To make things even more interesting, we can add some combinatorial conditions on the triangulations we are considering (e.g., flagness, balancedness, etc.) and ask what additional restrictions these combinatorial conditions impose. While only a few theorems in this area of combinatorics were known a couple of decades ago, in the last ten years or so, the field simply exploded with new results and ideas. Thus we feel that a survey paper is long overdue. As new theorems are being proved while we are typing this chapter, and as we have only a limited number of pages, we apologize in advance to our friends and colleagues, some of whose results will not get mentioned here.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.