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...
| Main Authors: | , , , , |
|---|---|
| 格式: | Article |
| 語言: | English |
| 出版: |
Discrete Mathematics & Theoretical Computer Science
2012-01-01
|
| 叢編: | Discrete Mathematics & Theoretical Computer Science |
| 主題: | |
| 在線閱讀: | https://dmtcs.episciences.org/3082/pdf |