[Paper Review] Betti numbers of Stanley--Reisner rings with pure resolutions

Gábor Hegedüs|arXiv (Cornell University)|Sep 2, 2010

Commutative Algebra and Its Applications21 references3 citations

TL;DR

This paper derives explicit formulas for Betti numbers and Hilbert–Samuel multiplicity of Stanley–Reisner rings with pure resolutions, expressing them in terms of the h-vector of the underlying simplicial complex. The key contribution is establishing linear equations and inequalities for the h-vectors of clique complexes of chordal graphs and Cohen–Macaulay simplicial complexes via duality and resolution theory.

ABSTRACT

Let $Δ$ be simplicial complex and let $k[Δ]$ denote the Stanley--Reisner ring corresponding to $Δ$. Suppose that $k[Δ]$ has a pure free resolution. Then we describe the Betti numbers and the Hilbert--Samuel multiplicity of $k[Δ]$ in terms of the $h$--vector of $Δ$. As an application, we derive a linear equation system and some inequalities for the components of the $h$--vector of the clique complex of an arbitrary chordal graph. As an other application, we derive a linear equation system and some inequalities for the components of the $h$--vector of Cohen--Macaulay simplicial complexes.

Motivation & Objective

• To express Betti numbers and Hilbert–Samuel multiplicity of Stanley–Reisner rings with pure resolutions in terms of the h-vector of the simplicial complex.
• To establish linear equations and inequalities for the h-vector components of the clique complex of a chordal graph.
• To derive analogous constraints for the h-vector of Cohen–Macaulay simplicial complexes.
• To apply duality and resolution theory to connect algebraic invariants with combinatorial data of the complex.
• To generalize Fröberg’s characterization of linear resolutions to higher-dimensional complexes via pure resolutions.

Proposed method

• Utilizes the Eagon–Reiner theorem to relate the Alexander dual of a simplicial complex to the resolution type of its Stanley–Reisner ring.
• Applies the Hilbert–Serre theorem to express the Hilbert series and multiplicity via the h-vector and binomial coefficients.
• Employs the duality between a simplicial complex Δ and its Alexander dual Δ* to derive formulas for Betti numbers and multiplicity.
• Uses the condition that a Stanley–Reisner ring has a pure resolution to derive explicit formulas involving binomial coefficients and h-vector components.
• Applies the characterization of chordal graphs as clique complexes of quasi-forests to link graph-theoretic properties to algebraic invariants.
• Derives inequalities and equations by combining the pure resolution condition with the sign alternation of binomial coefficients in the multiplicity formula.

Experimental results

Research questions

• RQ1 How can the Betti numbers of a Stanley–Reisner ring with a pure resolution be expressed in terms of the h-vector of the underlying simplicial complex?
• RQ2 What linear equations and inequalities constrain the h-vector of the clique complex of a chordal graph?
• RQ3 How do the Betti numbers and Hilbert–Samuel multiplicity of a Cohen–Macaulay simplicial complex relate to its h-vector?
• RQ4 What role does the Alexander dual play in transforming resolution data into combinatorial constraints on the h-vector?
• RQ5 Can the pure resolution condition be used to derive universal inequalities for Betti numbers in terms of h-vector components?

Key findings

• The Betti numbers of a Stanley–Reisner ring with a pure resolution are given by the formula $\beta_i = \sum_{\ell=0}^{2+i} (-1)^{\ell+i+1} h_{2+i-\ell} \binom{n-d}{\ell} $, where $n$ is the number of vertices and $d$ is the dimension of the complex.
• For the clique complex of a chordal graph, the h-vector satisfies $\sum_{\ell=0}^{j} (-1)^\ell h_{j-\ell} \binom{n-d}{\ell} = 0$ for $j=1$ or $p+2 < j \leq n$, where $p$ is the projective dimension.
• The Hilbert–Samuel multiplicity of $k[\Delta^*]$ is given by $e(k[\Delta^*]) = \frac{(-1)^{k^*}}{k^*!} \sum_{i=0}^p (-1)^i \beta_i^* (n-d+i)^{k^*} $, where $k^*$ is defined by the condition $\binom{n}{k^*} \neq f_{k^*-1}$ but $\binom{n}{k^*-1} = f_{k^*-2}$.
• For Cohen–Macaulay complexes, the inequality $\sum_{\ell=0}^{t+i} (-1)^{\ell+i+1} \binom{k^*}{\ell} h^*_{t+i-\ell} \geq \binom{p}{i} $ holds for all $0 \leq i \leq p$, with $t = n-d$.
• The h-vector of the clique complex of a chordal graph satisfies the equation $\sum_{\ell=0}^{2+i} (-1)^{\ell+i+1} \binom{n-d}{\ell} h_{2+i-\ell} \geq \binom{p}{i} $ for all $0 \leq i \leq p$, derived from the 2-linear resolution of the complementary graph’s edge ideal.
• The h-vector components of a Cohen–Macaulay simplicial complex are constrained by the identity $\binom{n}{k^*} - f_{k^*-1} = \frac{(-1)^{k^*}}{k^*!} \sum_{i=0}^p (-1)^i \beta_i^* (n-d+i)^{k^*} $, linking combinatorics to algebraic invariants.