Set Partitions with No m-Nesting

Marni Mishna () and Lily Yen ()
Additional contact information
Marni Mishna: Simon Fraser University, Department of Mathematics
Lily Yen: Simon Fraser University, Department of Mathematics

A chapter in Advances in Combinatorics, 2013, pp 249-258 from Springer

Abstract: Abstract A partition of $$\{1,\ldots,n\}$$ has an m-nesting if it contains at least m disjoint blocks, and a subset of 2m points $$i_{1}

Keywords: Set partition; Nesting; Pattern avoidance; Generating tree; Algebraic kernel method; Coefficient extraction; Enumeration (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-30979-3_13

Ordering information: This item can be ordered from
http://www.springer.com/9783642309793

DOI: 10.1007/978-3-642-30979-3_13

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().