![]() |
Discrete Mathematics & Theoretical Computer Science |
We describe a generating tree approach to the enumeration and exhaustive generation of k-nonnesting set partitions and permutations. Unlike previous work in the literature using the connections of these objects to Young tableaux and restricted lattice walks, our approach deals directly with partition and permutation diagrams. We provide explicit functional equations for the generating functions, with k as a parameter.
Source : ScholeXplorer
IsRelatedTo ARXIV math/0510676 Source : ScholeXplorer IsRelatedTo DOI 10.1016/j.aam.2005.12.006 Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.math/0510676
|