Indexed metadata

Lattice Bruhat intervals are polytopal

Yibo Gao, Tao Gui

Source record

Source: arXiv

Published: Oct 13, 2026

arXiv: 2610.17798

Open original source ↗

Source abstract

For a Bruhat interval [x,y][x,y] in an arbitrary Coxeter group which is a lattice, we give a type-uniform construction of a convex polytope whose complete face lattice realizes [x,y][x,y]. This gives a polytopal realization of the coincidence between classical Kazhdan--Lusztig polynomials for lattice Bruhat intervals and Stanley's toric gg-polynomials. Consequently, the Kazhdan--Lusztig polynomial of a lattice Bruhat interval cannot have internal zeros, satisfies a multiplicative strengthening of monotonicity, and obeys the generalized upper bound theorem for polytopes. For lattice Bruhat intervals in finite Weyl groups, we explain the relation with the toric geometry of Richardson varieties and derive formulas for their local and global intersection cohomology, as well as a Boolean criterion for rational smoothness. We conjecture that the coefficients of these Kazhdan--Lusztig polynomials form an MM-sequence.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Lattice Bruhat intervals are polytopal — Mathematical Frontier Network