# The biHecke monoid of a finite Coxeter group

Abstract : For any finite Coxeter group $W$, we introduce two new objects: its cutting poset and its biHecke monoid. The cutting poset, constructed using a generalization of the notion of blocks in permutation matrices, almost forms a lattice on $W$. The construction of the biHecke monoid relies on the usual combinatorial model for the $0-Hecke$ algebra $H_0(W)$, that is, for the symmetric group, the algebra (or monoid) generated by the elementary bubble sort operators. The authors previously introduced the Hecke group algebra, constructed as the algebra generated simultaneously by the bubble sort and antisort operators, and described its representation theory. In this paper, we consider instead the monoid generated by these operators. We prove that it admits |W| simple and projective modules. In order to construct the simple modules, we introduce for each $w∈W$ a combinatorial module $T_w$ whose support is the interval $[1,w]_R$ in right weak order. This module yields an algebra, whose representation theory generalizes that of the Hecke group algebra, with the combinatorics of descents replaced by that of blocks and of the cutting poset.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [10 references]

https://hal.inria.fr/hal-00632270
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Monday, August 24, 2015 - 3:47:14 PM
Last modification on : Sunday, June 26, 2022 - 12:04:01 PM
Long-term archiving on: : Wednesday, November 25, 2015 - 5:29:33 PM

### File

dmAN0116.pdf
Publisher files allowed on an open archive

### Citation

Florent Hivert, Anne Schilling, Nicolas M. Thiéry. The biHecke monoid of a finite Coxeter group. 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), 2010, San Francisco, United States. pp.307-318, ⟨10.46298/dmtcs.2851⟩. ⟨hal-00632270v2⟩

Record views