Weak Lehmer codes yield an algorithm that constructs multicomplexes matching the rank functions of F4 Bruhat intervals, and the palindromic Poincaré polynomials of F4 form a lattice inside the Bruhat poset.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A weak Lehmer code for type $F_4$
Weak Lehmer codes yield an algorithm that constructs multicomplexes matching the rank functions of F4 Bruhat intervals, and the palindromic Poincaré polynomials of F4 form a lattice inside the Bruhat poset.