Mathematics – Combinatorics
Scientific paper
2009-12-11
DMTCS proc AN (2010) 307-318
Mathematics
Combinatorics
12 pages, 1 figure, submitted to FPSAC'10
Scientific paper
The usual combinatorial model for the 0-Hecke algebra of the symmetric group is to consider the algebra (or monoid) generated by the bubble sort operators. This construction generalizes to any finite Coxeter group W. 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 has |W| simple and projective modules. In order to construct a combinatorial model for the simple modules, we introduce for each w in W a combinatorial module whose support is the interval [1,w] in right weak order. This module yields an algebra, whose representation theory generalizes that of the Hecke group algebra. This involves the introduction of a w-analogue of the combinatorics of descents of W and a generalization to finite Coxeter groups of blocks of permutation matrices.
Hivert Florent
Schilling Anne
Thiéry Nicolas M.
No associations
LandOfFree
The biHecke monoid of a finite Coxeter group does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The biHecke monoid of a finite Coxeter group, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The biHecke monoid of a finite Coxeter group will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-468130