Authors: Sophie Burrill ¹; Sergi Elizalde ²; Marni Mishna ¹; Lily Yen ^1,3

• 1 Department of Mathematics [Burnaby]
• 2 Department of Mathematics [Dartmouth]
• 3 Department of Mathematics and Statistics [Capilano]

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.