A weak Lehmer code for type $F_4$
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916005130797056 |
|---|---|
| author | Sentinelli, Paolo Zatti, Andrea |
| author_facet | Sentinelli, Paolo Zatti, Andrea |
| contents | We provide an algorithm to construct a multicomplex for any lower Bruhat interval of $F_4$, such that its rank--generating function equals that of the Bruhat interval. For Weyl groups, it is always possible to find such a multicomplex thanks to the work of Björner and Ekedahl. The algorithm is based on only two functions, which weaken the notion of Lehmer code for finite Coxeter groups, motivated by the fact that a strong Lehmer code for type $F_4$ does not exist. We also realize the set of palindromic Poincaré polynomials of $F_4$ as an induced subposet of the Bruhat order that forms a lattice. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_20981 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A weak Lehmer code for type $F_4$ Sentinelli, Paolo Zatti, Andrea Combinatorics We provide an algorithm to construct a multicomplex for any lower Bruhat interval of $F_4$, such that its rank--generating function equals that of the Bruhat interval. For Weyl groups, it is always possible to find such a multicomplex thanks to the work of Björner and Ekedahl. The algorithm is based on only two functions, which weaken the notion of Lehmer code for finite Coxeter groups, motivated by the fact that a strong Lehmer code for type $F_4$ does not exist. We also realize the set of palindromic Poincaré polynomials of $F_4$ as an induced subposet of the Bruhat order that forms a lattice. |
| title | A weak Lehmer code for type $F_4$ |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2509.20981 |