User talk:68.179.36.97

In the mathematical study of polyhedral combinatorics, Dehn–Sommerville equations are linear equations that apply to the numbers of faces of simple polytopes.

Their existence was conjectured by Max Dehn in 1905 who found them in dimension at most 5. They were discovered and proved by Duncan Sommerville in 1927.

Formulation

Let P be a d-dimensional simple polytope. Denote by f_i the number of i-dimensional faces of P, i = 0, 1, ..., d. Then:

$\sum _{i=k}^{d}(-1)^{i}{\binom {i}{k}}f_{i}\,=\,\sum _{i=d-k}^{d}(-1)^{d-i}{\binom {i}{d-k}}f_{i}{\text{ for }}0\leq k<{\frac {d}{2}}.$

When k = 0, this equation is the Euler characteristic of a (d − 1)-sphere.

There is an easier way to write these equations. Let F(t) be a generating polynomial for f_i:

$F(t)\,=\,\sum _{i=0}^{d}\,f_{i}\,t^{i}.$

Define h-vector h_i as follows:

$F(t-1)\,=\,\sum _{i=0}^{d}\,h_{i}\,t^{i}.$

Now the Dehn–Sommerville equations can be written as

$h_{k}=h_{d-k}{\text{ for }}0\leq k<d/2.\,$

References

• A. Barvinok, A Course in Convexity, American Mathematical Society, Providence, 2002. ISBN 0-8218-2968-8
• M. Bayer, A review of "A Course in Convexity", The American Mathematical Monthly, February 2004.
• G. Ziegler, Lectures on Polytopes, Springer, 1998. ISBN 0-387-94365-X.