On noncrossing and nonnesting partitions of type D

DOI10.1007/S00026-011-0114-5zbMATH Open1233.05033arXiv0905.4371OpenAlexW2024802755MaRDI QIDQ659657FDOQ659657

Authors: Alessandro Conflitti, Ricardo Mamede 

Publication date: 24 January 2012

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

Abstract: We present an explicit bijection between noncrossing and nonnesting partitions of Coxeter systems of type D which preserves openers, closers and transients.

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

zbMATH Keywords

bijectionroot systemsnoncrossing partitionsnonnesting partitions

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorial identities, bijective combinatorics (05A19)

Cites Work

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

Cited In (13)

• Title not available (Why is that?)
• Facets of the generalized cluster complex and regions in the extended Catalan arrangement of type \(A\)
• New interpretations for noncrossing partitions of classical types
• A bijection between noncrossing and nonnesting partitions of types A and B
• Chain enumeration of \(k\)-divisible noncrossing partitions of classical types
• Title not available (Why is that?)
• Non-crossing linked partitions, the partial order ≪ on 𝑁𝐶(𝑛), and the 𝑆-transform
• Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
• Bijections between noncrossing and nonnesting partitions for classical reflection groups
• On the graded dual numbers, arcs, and non-crossing partitions of the integers
• Charmed roots and the Kroweras complement
• Crossings and nestings in set partitions of classical types
• Title not available (Why is that?)

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)