| Publication type: |
 |
Preprint, Working Paper, ... |
|
| Subject: |
|
|
|
| Title: |
|
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial |
|
| Author(s): |
|
Frédérique Bassino ( ) 1, Mathilde Bouvel ( ) 2, Adeline Pierrot ( ) 2, Dominique Rossin ( ,  ) 3 |
|
| Laboratory: |
|
|
|
| Abstract: |
|
We present an algorithm running in time O(n ln n) which decides if a wreath-closed permutation class Av(B) given by its finite basis B contains a finite number of simple permutations. The method we use is based on an article of Brignall, Ruskuc and Vatter which presents a decision procedure (of high complexity) for solving this question, without the assumption that Av(B) is wreath-closed. Using combinatorial, algorithmic and language theoretic arguments together with one of our previous results on pin-permutations, we are able to transform the problem into a co-finiteness problem in a complete deterministic automaton. |
|
| Fulltext language: |
|
English |
|
| Production date: |
|
2010-11-30 |
|
|
| ANR Project: |
|
| Project Id |
ANR-07-BLAN-0330 |
| Year |
2007 |
| Project acronyme |
BLANC |
| Project title |
Génération Aléatoire : Modèles, Méthodes et Algorithmes |
| Intitule |
Blanc |
| Acronyme |
GAMMA |
|
|
|
Export this paper
