Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial

Frédérique Bassino (1) , Mathilde Bouvel (2) , Adeline Pierrot (2) , Dominique Rossin (3)

1 LIPN - Laboratoire d'Informatique de Paris-Nord
2 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
3 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]

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.

Domaines: Algorithme et structure de données [cs.DS]; Combinatoire [math.CO]

Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Dominique Rossin. Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial. 2010. ⟨hal-00458295v1⟩