{
  "id": "1505.06380",
  "version": "v1",
  "published": "2015-05-23T21:41:45.000Z",
  "updated": "2015-05-23T21:41:45.000Z",
  "title": "Face enumeration on simplicial complexes",
  "authors": [
    "Steven Klee",
    "Isabella Novik"
  ],
  "comment": "Chapter for upcoming IMA volume Recent Trends in Combinatorics",
  "categories": [
    "math.CO"
  ],
  "abstract": "Let $M$ be a closed triangulable manifold, and let $\\Delta$ be a triangulation of $M$. What is the smallest number of vertices that $\\Delta$ can have? How big or small can the number of edges of $\\Delta$ be as a function of the number of vertices? More generally, what are the possible face numbers ($f$-numbers, for short) that $\\Delta$ 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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-05-23T21:41:45.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "simplicial complexes",
      "face enumeration",
      "triangulation",
      "combinatorial conditions impose",
      "smallest number"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2015arXiv150506380K"
    }
  }
}