Dehn–Sommerville equations

Dehn–Sommerville equations

In mathematics, the Dehn–Sommerville equations are a complete set of linear relations between the numbers of faces of different dimension of a simplicial polytope. For polytopes of dimension 4 and 5, they were found by Max Dehn in 1905. Their general form was established by Duncan Sommerville in 1927. The Dehn–Sommerville equations can be restated as a symmetry condition for the h-vector of the simplicial polytope and this has become the standard formulation in recent combinatorics literature. By duality, analogous equations hold for simple polytopes.

Statement

Let P be a d-dimensional simplicial polytope. For i = 0, 1, ..., d−1, let fi denote the number of i-dimensional faces of P. The sequence

 f(P)=(f_0,f_1,\ldots,f_{d-1})

is called the f-vector of the polytope P. Additionally, set

f − 1 = 1,fd = 1.

Then for any k = −1, 0, …, d−2, the following Dehn–Sommerville equation holds:

\sum_{j=k}^{d-1} (-1)^{j} \binom{j+1}{k+1}  f_j = (-1)^{d-1}f_k.

When k = −1, it expresses the fact that Euler characteristic of a (d − 1)-dimensional simplicial sphere is equal to 1 + (−1)d−1.

Dehn–Sommerville equations with different k are not independent. There are several ways to choose a maximal independent subset consisting of \left[\frac{d+1}{2}\right] equations. If d is even then the equations with k = 0, 2, 4, …, d−2 are independent. Another independent set consists of the equations with k = −1, 1, 3, …, d−3. If d is odd then the equations with k = −1, 1, 3, …, d−2 form one independent set and the equations with k = −1, 0, 2, 4, …, d−3 form another.

Equivalent formulations

Sommerville found a different way to state these equations:

 \sum_{i=-1}^{k-1}(-1)^{d+i}\binom{d-i-1}{d-k} f_i = 
\sum_{i=-1}^{d-k-1}(-1)^{i}\binom{d-i-1}{k} f_i,

where 0 ≤ k ≤ ½(d−1). This can be further facilitated introducing the notion of h-vector of P. For k = 0, 1, …, d, let

 h_k = \sum_{i=0}^k (-1)^{k-i}\binom{d-i}{k-i}f_{i-1}.

The sequence

h(P)=(h_0,h_1,\ldots,h_d)

is called the h-vector of P. The f-vector and the h-vector uniquely determine each other through the relation

 \sum_{i=0}^{d}f_{i-1}(t-1)^{d-i}=\sum_{k=0}^{d}h_{k}t^{d-k}.

Then the Dehn–Sommerville equations can be restated simply as

 h_k = h_{d-k} \quad\textrm{for}\quad 0\leq k\leq d.

The equations with 0 ≤ k ≤ ½(d−1) are independent, and the others are manifestly equivalent to them.

Richard Stanley gave an interpretation of the components of the h-vector of a simplicial convex polytope P in terms of the projective toric variety X associated with (the dual of) P. Namely, they are the dimensions of the even intersection cohomology groups of X:

 h_k=\operatorname{dim}_{\mathbb{Q}}\operatorname{IH}^{2k}(X,\mathbb{Q})

(the odd intersection cohomology groups of X are all zero). In this language, the last form of the Dehn–Sommerville equations, the symmetry of the h-vector, is a manifestation of the Poincaré duality in the intersection cohomology of X.

References

  • Richard Stanley, Combinatorics and commutative algebra. Second edition. Progress in Mathematics, 41. Birkhäuser Boston, Inc., Boston, MA, 1996. x+164 pp. ISBN 0-8176-3836-9

Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • Duncan Sommerville — FRSE Born 24 November, 1879 Beawar, Rajputana, India Died 31 January, 1934 Wellington, New Zealand …   Wikipedia

  • Max Dehn — Born November 13, 1878(1878 11 13) …   Wikipedia

  • Duncan MacLaren Young Sommerville — (November 24, 1879, Beawar, Rajasthan, India – January 31, 1934, Wellington, New Zealand) was a mathematician best known for his work in multidimensional geometry.Sommerville studied at the University of St Andrews. He taught there from 1902 to… …   Wikipedia

  • List of mathematics articles (D) — NOTOC D D distribution D module D D Agostino s K squared test D Alembert Euler condition D Alembert operator D Alembert s formula D Alembert s paradox D Alembert s principle Dagger category Dagger compact category Dagger symmetric monoidal… …   Wikipedia

  • Polyhedral combinatorics — is a branch of mathematics, within combinatorics and discrete geometry, that studies the problems of counting and describing the faces of convex polyhedra and higher dimensional convex polytopes.A key question in polyhedral combinatorics is to… …   Wikipedia

  • Simplicial complex — In mathematics, a simplicial complex is a topological space of a particular kind, constructed by gluing together points, line segments, triangles, and their n dimensional counterparts (see illustration). Simplicial complexes should not be… …   Wikipedia

  • Simple polytope — In geometry, a d dimensional simple polytope is a polytope each of whose vertices is adjacent to exactly d edges.They are topologically dual to simplicial polytopes. The family of polytopes which are bothsimple and simplicial are simplices or two …   Wikipedia

  • Simplicial sphere — In geometry and combinatorics, a simplicial (or combinatorial) d sphere is a simplicial complex homeomorphic to the d dimensional sphere. Some simplicial spheres arise as the boundaries of convex polytopes, however, in higher dimensions most… …   Wikipedia

  • Cyclic polytope — In mathematics, a cyclic polytope, denoted C(n,d), is a convex polytope formed as a convex hull of n distinct points on a rational normal curve in Rd, where n is greater than d. These polytopes were studied by Constantin Carathéodory, David Gale …   Wikipedia

  • Neighborly polytope — In geometry and polyhedral combinatorics, a k neighborly polytope is a convex polytope in which every set of k or fewer vertices forms a face. For instance, a 2 neighborly polytope is a polytope in which every pair of vertices is connected by an… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”