Set Partitions with No m-Nesting
From MaRDI portal
Abstract: A partition on [n] has an m-nesting if there exists i_1 < i_2 < ... < i_m < j_m < j_{m-1} < ... < j_1, where i_l and j_l are in the same block for all 1 <= l <= m. We use generating trees to construct the class of partitions with no m-nesting and determine functional equations satisfied by the associated generating functions. We use algebraic kernel method together with a linear operator to describe a coefficient extraction process. This gives rise to enumerative data, and illustrates the increasing complexity of the coefficient formulas as m increases.
Recommendations
- scientific article; zbMATH DE number 6739377
- Nested sets, set partitions and Kirkman-Cayley dissection numbers
- Partition-free families of sets
- Partition-free families of sets
- Set partitions and non-crossing partitions with -neighbors and -isolated elements
- Partitions of positive integers into sets without infinite progressions
- Partitions into sum-free sets
- scientific article; zbMATH DE number 975326
- Gap‐Free Set Partitions
- On the sets represented by the partitions of an integer \(n\)
Cited in
(5)- A simple bijection for enhanced, classical, and 2-distant \(k\)-noncrossing partitions
- Nested sets, set partitions and Kirkman-Cayley dissection numbers
- Generating trees for partitions and permutations with no k-nestings
- scientific article; zbMATH DE number 6739377 (Why is no real title available?)
- A generating tree approach to k-nonnesting partitions and permutations
This page was built for publication: Set Partitions with No m-Nesting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2846964)
