On noncrossing and nonnesting partitions of type D
From MaRDI portal
Publication:659657
Abstract: We present an explicit bijection between noncrossing and nonnesting partitions of Coxeter systems of type D which preserves openers, closers and transients.
Cites work
- \(K(\pi,1)\)'s for Artin groups of finite type.
- A bijection between noncrossing and nonnesting partitions of types A and B
- A bijection between noncrossing and nonnesting partitions of types A and B
- A simple and direct derivation for the number of noncrossing partitions
- Bijections between noncrossing and nonnesting partitions for classical reflection groups
- Chain enumeration and non-crossing partitions
- Combinatorial statistics on non-crossing partitions
- Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations
- Combinatorial theory of the free product with amalgamation and operator-valued free probability theory
- Combinatorics of Coxeter Groups
- Crossings and nestings in set partitions of classical types
- Crossings and nestings of matchings and partitions
- Distribution of crossings, nestings and alignments of two edges in matchings and partitions
- Generalized noncrossing partitions and combinatorics of Coxeter groups
- scientific article; zbMATH DE number 47598 (Why is no real title available?)
- Lectures on the Combinatorics of Free Probability
- Non-crossing partitions for classical reflection groups
- Noncrossing partitions
- Noncrossing Partitions for the GroupDn
- On noncrossing and nonnesting partitions for classical reflection groups
- Ordered trees and non-crossing partitions
- Shellability of noncrossing partition lattices
- Some properties of crossings and partitions
- Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
- Tamari lattices and noncrossing partitions in type \(B\)
- The \(M\)-triangle of generalised non-crossing partitions for the types \(E_7\) and \(E_8\).
Cited in
(13)- On the graded dual numbers, arcs, and non-crossing partitions of the integers
- Crossings and nestings in set partitions of classical types
- Chain enumeration of k-divisible noncrossing partitions of classical types
- New interpretations for noncrossing partitions of classical types
- scientific article; zbMATH DE number 6909258 (Why is no real title available?)
- Non-crossing linked partitions, the partial order ≪ on 𝑁𝐶(𝑛), and the 𝑆-transform
- Facets of the generalized cluster complex and regions in the extended Catalan arrangement of type \(A\)
- scientific article; zbMATH DE number 6928860 (Why is no real title available?)
- scientific article; zbMATH DE number 6806833 (Why is no real title available?)
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
- A bijection between noncrossing and nonnesting partitions of types A and B
- Bijections between noncrossing and nonnesting partitions for classical reflection groups
- Charmed roots and the Kroweras complement
This page was built for publication: On noncrossing and nonnesting partitions of type \(D\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659657)
