A generating tree approach to \(k\)-nonnesting partitions and permutations

DOI10.1007/S00026-016-0321-1zbMath1347.05006arXiv1108.5615OpenAlexW1927422331MaRDI QIDQ331488

Lily Yen, Marni Mishna, Sergi Elizalde, Sophie Burrill

Publication date: 27 October 2016

Published in: Annals of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

partitionenumerationpermutationgenerating treenonnesting

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Combinatorial aspects of representation theory (05E10)

Related Items (9)

A simple bijection for enhanced, classical, and 2-distant \(k\)-noncrossing partitions ⋮ Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels ⋮ Pattern-avoiding inversion sequences and open partition diagrams ⋮ Pattern avoidance in matchings and partitions ⋮ Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions ⋮ Tableau sequences, open diagrams, and Baxter families ⋮ Unnamed Item ⋮ Slicings of parallelogram polyominoes: Catalan, Schröder, Baxter, and other sequences ⋮ A combinatorial bijection on \(k\)-noncrossing partitions

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Crossings and nestings in colored set partitions
• Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry
• Counting permutations with no long monotone subsequence via generating trees and the kernel method
• Baxter permutations and plane bipolar orientations
• The X-class and almost-increasing permutations
• The enumeration of permutations with a prescribed number of ``forbidden patterns
• Bijections between oscillating tableaux and (semi)standard tableaux via growth diagrams
• On partitions avoiding 3-crossings
• On the symmetry of the distribution of \(k\)-crossings and \(k\)-nestings in graphs
• \(k\)-noncrossing and \(k\)-nonnesting graphs and fillings of Ferrers diagrams
• Crossings and nestings in tangled diagrams
• Ordered trees and non-crossing partitions
• Generating functions for generating trees
• Generating trees and the Catalan and Schröder numbers
• Noncrossing partitions
• Combinatorics of RNA structures with pseudoknots
• Bijections for Baxter families and related objects
• New interpretations for noncrossing partitions of classical types
• Crossings and alignments of permutations
• A Baxter class of a different kind, and other bijective results using tableau sequences ending with a row shape
• Set Partitions with No m-Nesting
• Random k -noncrossing RNA structures
• Crossings and nestings of matchings and partitions
• On k-crossings and k-nestings of permutations
• ECO:a methodology for the enumeration of combinatorial objects

This page was built for publication: A generating tree approach to \(k\)-nonnesting partitions and permutations