Enumeration of \((k,2)\)-noncrossing partitions

DOI10.1016/j.disc.2007.08.068zbMath1162.05002arXiv0808.1157OpenAlexW1991970577MaRDI QIDQ941401

Simone Severini, Toufik Mansour

Publication date: 4 September 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

partitionskernel methodforbidden subsequences

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17)

Related Items (7)

Pattern avoidance in matchings and partitions ⋮ Catalan pairs: a relational-theoretic approach to Catalan numbers ⋮ Bijections on two variations of noncrossing partitions ⋮ Eigenvalues of the difference matrices of the Lee partition ⋮ A note on 2-distant noncrossing partitions and weighted Motzkin paths ⋮ Partitions of a set satisfying certain set of conditions ⋮ Combinatorial properties of Catalan pairs

Uses Software

• OEIS

Cites Work

• Generating functions for generating trees
• On trees and noncrossing partitions
• Reduction of \(m\)-regular noncrossing partitions
• On \(abab\)-free and \(abba\)-free set partitions
• Crossings and nestings of matchings and partitions
• Unnamed Item
• Unnamed Item

This page was built for publication: Enumeration of \((k,2)\)-noncrossing partitions