Sophie Burrill ; Sergi Elizalde ; Marni Mishna ; Lily Yen - Generating trees for partitions and permutations with no k-nestings

dmtcs:3050 - Discrete Mathematics & Theoretical Computer Science, January 1, 2012, DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012) - https://doi.org/10.46298/dmtcs.3050
Generating trees for partitions and permutations with no k-nestings

Authors: Sophie Burrill ; Sergi Elizalde ORCID-iD; Marni Mishna ; Lily Yen

    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.


    Volume: DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)
    Section: Proceedings
    Published on: January 1, 2012
    Imported on: January 31, 2017
    Keywords: permutation, generating tree,nonnesting, partition,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
    Fundings :
      Source : OpenAIRE Research Graph
    • Funder: Natural Sciences and Engineering Research Council of Canada
    • Pattern avoidance in dynamical systems; Funder: National Science Foundation; Code: 1001046

    Share

    Consultation statistics

    This page has been seen 143 times.
    This article's PDF has been downloaded 202 times.