Gray codes for noncrossing and nonnesting partitions of classical types
From MaRDI portal
Publication:5365322
DOI10.1142/S0218196717500230zbMath1372.94472MaRDI QIDQ5365322
Ricardo Mamede, Alessandro Conflitti
Publication date: 6 October 2017
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196717500230
Cites Work
- Unnamed Item
- Unnamed Item
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
- Gray codes for non-crossing partitions and dissections of a convex polygon
- Non-crossing partitions for classical reflection groups
- Combinatorics of Coxeter Groups
- The dual braid monoid
- Generalized noncrossing partitions and combinatorics of Coxeter groups
- A Survey of Combinatorial Gray Codes
- Noncrossing Partitions for the GroupDn
- Non-crossing partition lattices in finite real reflection groups