Math 2.0

Convex and discrete geometry Definition

f-vector

Builds on Convex polytopeFace of a convex setSimplicial complex

Definition

Let PP be a convex polytope of dimension d≥1d \ge 1. For 0≤i≤d−10 \le i \le d - 1, let fi(P)f_i(P) be the number of faces of PP of dimension ii. The f-vector of PP is (f0(P),f1(P),…,fd−1(P))(f_0(P), f_1(P), \dots, f_{d-1}(P)).

Remarks

Some authors add f−1=1f_{-1} = 1 for the empty face and fd=1f_d = 1 for PP itself. For a finite simplicial complex Δ\Delta, fi(Δ)f_i(\Delta) is the number of ii-dimensional simplices of Δ\Delta, defined in the same way.

Example: the cube [0,1]3[0,1]^3 has 88 vertices, 1212 edges and 66 square faces, so its f-vector is (8,12,6)(8, 12, 6).

Non-example: (4,6,3)(4, 6, 3) is not the f-vector of any 33-dimensional polytope. Every 33-polytope satisfies f0−f1+f2=2f_0 - f_1 + f_2 = 2, while 4−6+3=14 - 6 + 3 = 1.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Convex polytope concept
  2. Face of a convex set concept
  3. Simplicial complex concept
  4. f-vector definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Simplicial_complex
About this page
TagSJDZH6V0BC
URIm2://SJDZH6V0BC
Kinddefinition
WritingW0 stub
MSC52B05, 05E45
Definesf-vector
UsesConvex polytope, Face of a convex set, Simplicial complex

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.