On noncrossing and nonnesting partitions of type \(D\)

DOI10.1007/s00026-011-0114-5zbMath1233.05033arXiv0905.4371OpenAlexW2024802755MaRDI QIDQ659657

Alessandro Conflitti, Ricardo Mamede

Publication date: 24 January 2012

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0905.4371

zbMATH Keywords

root systemsbijectionnoncrossing partitionsnonnesting partitions

Mathematics Subject Classification ID

Related Items (4)

Bijections between noncrossing and nonnesting partitions for classical reflection groups ⋮ Facets of the generalized cluster complex and regions in the extended Catalan arrangement of type \(A\) ⋮ New interpretations for noncrossing partitions of classical types ⋮ Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions

Cites Work

• Unnamed Item
• Unnamed Item
• Bijections between noncrossing and nonnesting partitions for classical reflection groups
• Ordered trees and non-crossing partitions
• Chain enumeration and non-crossing partitions
• On noncrossing and nonnesting partitions for classical reflection groups
• Combinatorial statistics on non-crossing partitions
• Some properties of crossings and partitions
• Non-crossing partitions for classical reflection groups
• \(K(\pi,1)\)'s for Artin groups of finite type.
• Crossings and nestings in set partitions of classical types
• Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations
• Noncrossing partitions
• Tamari lattices and noncrossing partitions in type \(B\)
• Distribution of crossings, nestings and alignments of two edges in matchings and partitions
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• The \(M\)-triangle of generalised non-crossing partitions for the types \(E_7\) and \(E_8\).
• Combinatorics of Coxeter Groups
• Lectures on the Combinatorics of Free Probability
• Shellability of noncrossing partition lattices
• Crossings and nestings of matchings and partitions
• Generalized noncrossing partitions and combinatorics of Coxeter groups
• Combinatorial theory of the free product with amalgamation and operator-valued free probability theory
• A simple and direct derivation for the number of noncrossing partitions
• Noncrossing Partitions for the GroupDn
• A bijection between noncrossing and nonnesting partitions of types A and B

This page was built for publication: On noncrossing and nonnesting partitions of type \(D\)