Bijections on two variations of noncrossing partitions

DOI10.1016/J.ENDM.2009.07.046zbMath1273.05010DBLPjournals/endm/Kim09arXiv0812.4091OpenAlexW2138595743WikidataQ60692179 ScholiaQ60692179MaRDI QIDQ5891222

Jang Soo Kim

Publication date: 10 October 2013

Published in: Electronic Notes in Discrete Mathematics, Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Motzkin pathspattern avoidancenoncrossing partitionsnoncrossing partitionSchröder pathsMotzkin pathSchröder path

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Combinatorial identities, bijective combinatorics (05A19)

Related Items (2)

A simple bijection for enhanced, classical, and 2-distant \(k\)-noncrossing partitions ⋮ A note on 2-distant noncrossing partitions and weighted Motzkin paths

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Enumeration of \((k,2)\)-noncrossing partitions
• Combinatorial aspects of continued fractions
• 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)
• $k$-distant crossings and nestings of matchings and partitions
• Crossings and nestings of matchings and partitions
• Schr\"oder Paths and Pattern Avoiding Partitions
• Generalized noncrossing partitions and combinatorics of Coxeter groups

This page was built for publication: Bijections on two variations of noncrossing partitions