Combinatorial specification of permutation classes

zbMath1412.05003arXiv1204.0797MaRDI QIDQ5377427

Mathilde Bouvel, Adeline Pierrot, Dominique Rossin, Carine Pivoteau, Frédérique Bassino

Publication date: 24 May 2019

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

zbMATH Keywords

generating functionsrandom generationsimple permutationscombinatorial specificationpermutation classessubstitution decompositionexcluded patterns

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (2)

An algorithm for deciding the finiteness of the number of simple permutations in permutation classes ⋮ On the effective and automatic enumeration of polynomial permutation classes

This page was built for publication: Combinatorial specification of permutation classes