Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 18 min ago
PreprintCC BY 4.0arXiv

Lattice Bruhat intervals are polytopal

Abstract

For a Bruhat interval [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]. This gives a polytopal realization of the coincidence between classical Kazhdan--Lusztig polynomials for lattice Bruhat intervals and Stanley's toric g-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 M-sequence.

Related

  1. Bruhat intervals that are large hypercubes
    Jordan S. Ellenberg, Nicolás Libedinsky, David Plaza +2
    International Mathematics Research NoticesPeer-reviewedLicence not statedFull text13 citedCombinatorics & discrete mathematicsOpenAlex
  2. Bounded Bruhat intervals and affine Coxeter groups
    Grant T. Barkley, Christian Gaetz
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  3. Lattice points close to a smooth curve and squarefull numbers in short intervals. II
    Ognian Trifonov
    arXivPreprintCC BY-NC-ND 4.0Full textAlgebra & number theoryarXiv
  4. The lattice of antichains of intervals: Dyck paths, level sets, and sweep dimension
    Paolo Boldi, Sebastiano Vigna
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  5. A locking-free nodal-based polytopal method for linear elasticity
    Jérôme Droniou, Raman Kumar
    HALPreprintLicence not statedNumerical analysis & scientific computingHAL
BibTeX
@misc{gao2026lattice,
  title = {{Lattice Bruhat intervals are polytopal}},
  author = {Yibo Gao and Tao Gui},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.17798},
  eprint = {2610.17798},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.17798},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Lattice Bruhat intervals are polytopal
AU  - Yibo Gao
AU  - Tao Gui
PY  - 2026
DA  - 2026/10/13
PB  - arXiv
DO  - 10.48550/arxiv.2610.17798
UR  - https://arxiv.org/abs/2610.17798
AB  - For a Bruhat interval [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]. This gives a polytopal realization of the coincidence between classical Kazhdan--Lusztig polynomials for lattice Bruhat intervals and Stanley's toric g-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 M-sequence.
ER  -