Papers
Topics
Authors
Recent
Search
2000 character limit reached

Lattice Bruhat intervals are polytopal

Published 13 Oct 2026 in math.CO and math.AG | (2610.17798v1)

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.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.