The flag lower bound conjecture for g-numbers

Let Δ\Delta be a flag homology (d1)(d-1)-sphere, and let gi(Δ)g_i(\Delta) denote its gg-numbers. Flag lower bound conjecture.

gi(Δ)(di)(di1).g_i(\Delta)\geq \binom{d}{i}-\binom{d}{i-1}.

Equality holds if and only if Δ\Delta is the boundary complex of the dd-cross-polytope. This would give sharp lower bounds for the gg-numbers of flag homology spheres; the source explicitly states that the conjecture is open.

Sources & referencesView supporting material

Primary source

Hailun Zheng, “Face enumeration on flag complexes and flag spheres”, arXiv:1809.06835 (2018).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.