Set Partitions with No m-Nesting

DOI10.1007/978-3-642-30979-3_13zbMath1271.05012arXiv1106.5036OpenAlexW1831199005MaRDI QIDQ2846964

Lily Yen, Marni Mishna

Publication date: 4 September 2013

Published in: Advances in Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

enumerationpattern avoidancenestingset partitiongenerating treecoefficient extractionalgebraic kernel method

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18)

Related Items (2)

A generating tree approach to \(k\)-nonnesting partitions and permutations ⋮ A simple bijection for enhanced, classical, and 2-distant \(k\)-noncrossing partitions

Uses Software

• OEIS

This page was built for publication: Set Partitions with No m-Nesting