Résumé : The lattice of noncrossing set partitions of an n-set can be seen as a subgraph of the Cayley graph of the symmetric group S generated by all transpositions. We mimic this construction for the alternating group A2n+1 generated by all 3-cycles. The resulting poset provides a rich new source of combinatorics coming from the alternating groups, which in some sense parallels the combinatorics behind the noncrossing set partitions. We present some enumerative and bijective results, and suggest an extension of this construction to all finite Coxeter groups. This is joint work with Philippe Nadeau.
| Dernière modification : Monday 27 May 2024 |
|
Contact pour cette page : Cyril.Banderier at lipn.univ-paris13.fr |