Crossings and nestings in colored set partitions

zbMath1300.05039arXiv1203.5738MaRDI QIDQ396914

Eric Marberg

Publication date: 14 August 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

colored permutationsmatchingscrossings2-Motzkin pathscolored set partitionscolored tangled diagramsD-finite generating functionsnestingsvacillating tableaux

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of representation theory (05E10) Asymptotic enumeration (05A16)

Related Items (6)

Closed expressions for averages of set partition statistics ⋮ On some combinatorial sequences associated to invariant theory ⋮ A generating tree approach to \(k\)-nonnesting partitions and permutations ⋮ A simple bijection for enhanced, classical, and 2-distant \(k\)-noncrossing partitions ⋮ Fibonacci colored compositions and applications ⋮ Crossings and nestings for arc-coloured permutations and automation

Uses Software

• OEIS
• Asyrec
• EKHAD
• TANGLE

This page was built for publication: Crossings and nestings in colored set partitions