Sciweavers

DCG
2006

The Stirling Polynomial of a Simplicial Complex

14 years 19 days ago
The Stirling Polynomial of a Simplicial Complex
We introduce a new encoding of the face numbers of a simplicial complex, its Stirling polynomial, that has a simple expression obtained by multiplying each face number with an appropriate generalized binomial coefficient. We prove that the face numbers of the barycentric subdivision of the free join of two CW-complexes may be found by multiplying the Stirling polynomials of the barycentric subdivisions of the original complexes. We show that the Stirling polynomial of the order complex of any simplicial poset and of certain graded planar posets has non-negative coefficients. By calculating the Stirling polynomial of the order complex of the r-cubical lattice of rank n + 1 in two ways, we provide a combinatorial proof for the following identity of Bernoulli polynomials: 1 + rn n k=1 n k-1 k
Gábor Hetyei
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where DCG
Authors Gábor Hetyei
Comments (0)