A combinatorial proof of a formula for Betti numbers of a stacked polytope

Details A combinatorial proof of a formula for Betti numbers of a stacked polytope A combinatorial proof of a formula for Betti numbers of a stacked polytope

2009-02-14

arxiv.org/abs/0902.2444v1

Electron. J. Combin., 17(1), #R9, 2010

Mathematics

Combinatorics

7 pages

Scientific paper

For a simplicial complex $\Delta$, the graded Betti number $\beta_{i,j}(k[\Delta])$ of the Stanley-Reisner ring $k[\Delta]$ over a field $k$ has a combinatorial interpretation due to Hochster. Terai and Hibi showed that if $\Delta$ is the boundary complex of a $d$-dimensional stacked polytope with $n$ vertices for $d\geq3$, then $\beta_{k-1,k}(k[\Delta])=(k-1)\binom{n-d}{k}$. We prove this combinatorially.

Affiliated with

Also associated with

No associations

Rating

A combinatorial proof of a formula for Betti numbers of a stacked polytope does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A combinatorial proof of a formula for Betti numbers of a stacked polytope, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A combinatorial proof of a formula for Betti numbers of a stacked polytope will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-55225