Combinatorial specification of permutation classes

Combinatorial specification of permutation classes

This article presents a methodology that automatically derives a combinatorial specification for the permutation class $\mathcal{C} = Av(B)$, given its basis $B$ of excluded patterns and the set of simple permutations in $\mathcal{C}$, when these sets are both finite. This is achieved considering bo...

Full description

Bibliographic Details
Main Authors: Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Carine Pivoteau, Dominique Rossin
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2012-01-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
generating functions
simple permutations
substitution decomposition
excluded patterns
permutation classes
combinatorial specification
random generation
[math.math-co] mathematics [math]/combinatorics [math.co]
Online Access:https://dmtcs.episciences.org/3082/pdf

Internet

https://dmtcs.episciences.org/3082/pdf

Similar Items