Stanley’s matroid h-vector conjecture

For every finite matroid MM of rank rr, let Δ(M)\Delta(M) be its independence complex and let h(M)=(h0,…,hr)h(M)=(h_0,\ldots,h_r) be defined by ∑i=0rfi−1(Δ(M))(t−1)r−i=∑i=0rhitr−i\sum_{i=0}^{r}f_{i-1}(\Delta(M))(t-1)^{r-i}=\sum_{i=0}^{r}h_i t^{r-i}, where f−1(Δ(M))=1f_{-1}(\Delta(M))=1. Then h(M)h(M) is a pure OO-sequence: there exists a finite pure multicomplex Γ\Gamma of monomials such that hi=∣{u∈Γ:deg⁡u=i}∣h_i=|\{u\in\Gamma:\deg u=i\}| for every 0≤i≤r0\le i\le r.

References

Primary source

arXiv

Progress summary

Refreshed
Claimed progress

A new paper develops a construction that works for several important families of matroids, but the general conjecture remains open.

Stanley’s conjecture asserts that every matroid hh-vector is a pure OO-sequence. The general problem was unresolved in the 2013 survey literature and remains unresolved after the latest advance.

Known results

  • Matroid complexes of Krull dimension at most 22, including all hh-vectors of the form (1,h1,h2,h3)(1,h_1,h_2,h_3), were handled by H. T. Hà, E. Stokes, and F. Zanello (2013).

September 2026 fibre-system criterion

SuHo Oh’s paper introduces a sufficient fibre-system criterion for constructing the required pure multicomplexes and verifies it for coned, biconed, and triconed graphs, several named graphs, matroids of rank at most 33, corank 22, and uniform matroids. It also exhibits a twelve-vertex graph without a fibre system; this is substantial claimed progress, not a proof for general matroids.

Current status (as of September 2026): The conjecture is established in the cited low-dimensional cases and several additional families, while the general matroid case remains open; Oh’s new criterion is reported as progress but is not independently verified here.

Sources

Solutions 0

No solutions have been posted yet.