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

MaRDI QIDQ2380441zbMATH OpenFDO

Authors Suyoung Choi, Jang Soo Kim

Publication date 26 March 2010

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0902.2444, https://eudml.org/doc/224109, http://www.emis.de/journals/EJC/Volume_17/Abstracts/v17i1r9.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of commutative algebra (05E40) Combinatorial aspects of simplicial complexes (05E45) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

Abstract: For a simplicial complex $Delta$, the graded Betti number $$ 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 $dgeq3$, then $$. We prove this combinatorially.

Review text

Summary: For a simplicial complex \(\Delta\), the graded Betti number \(\beta_{i,j}({\mathbf k}[\Delta])\) of the Stanley-Reisner ring \({\mathbf k}[0]\) over a field \({\mathbf k}\) has a combinatorial interpretation due to Hochster. \textit{N. Terai} and \textit{T. Hibi} [Manuscr. Math. 92, No. 4, 447--453 (1997; Zbl 0882.13018)] showed that if \(\Delta\) is the boundary complex of a \(d\)-dimensional stacked polytope with \(n\) vertices for \(d\geq 3\), then \(\beta_{k-1,k}({\mathbf k}[\Delta])= (k-1){n-d\choose k}\). We prove this combinatorially.

Recommendations

• Computation of Betti numbers of monomial ideals associated with stacked polytopes
• On k-stacked polytopes
• Bigraded Betti numbers of certain simple polytopes
• scientific article; zbMATH DE number 1256756
• Computing Betti numbers via combinatorial Laplacians
• A combinatorial proof of a formula of Biane and Chapuy
• Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron
• Combinatorial structure and adjacency of vertices of polytope of \(b\)-factors
• Stackings and the W-cycles conjecture
• Betti numbers of the geometric spaces associated to nonrational simple convex polytopes

Cited in

(7)

• Computation of Betti numbers of monomial ideals associated with stacked polytopes
• Bigraded Betti numbers of certain simple polytopes
• Bounds for the Betti numbers of successive stellar subdivisions of a simplex
• Graded Betti numbers of balanced simplicial complexes
• Projective bundles over toric surfaces
• Face rings of cycles, associahedra, and standard Young tableaux
• Rigidity problems in toric topology: a survey

This page was built for publication: A combinatorial proof of a formula for Betti numbers of a stacked polytope

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380441)