Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A combinatorial proof of a formula for Betti numbers of a stacked polytope - MaRDI portal

A combinatorial proof of a formula for Betti numbers of a stacked polytope (Q2380441)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A combinatorial proof of a formula for Betti numbers of a stacked polytope
scientific article

    Statements

    A combinatorial proof of a formula for Betti numbers of a stacked polytope (English)
    0 references
    0 references
    0 references
    26 March 2010
    0 references
    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.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references