An algorithm for deciding the finiteness of the number of simple permutations in permutation classes - Archive ouverte HAL Access content directly
Journal Articles Advances in Applied Mathematics Year : 2015

An algorithm for deciding the finiteness of the number of simple permutations in permutation classes

Abstract

In this article, we describe an algorithm to determine whether a permutation class C given by a finite basis B of excluded patterns contains a finite number of simple permutations. This is a continuation of the work initiated in [Brignall, Ruškuc, Vatter, Simple permutations: decidability and unavoidable substructures, 2008], and shares several aspects with it. Like in this article, the main difficulty is to decide whether C contains a finite number of proper pin-permutations, and this decision problem is solved using automata theory. Moreover, we use an encoding of proper pin-permutations by words over a finite alphabet, introduced by Brignall et al. However, unlike in their article, our construction of automata is fully algorithmic and efficient. It is based on the study of pin-permutations in [6]. The complexity of the overall algorithm is O(n log n+s2k) where n denotes the sum of the sizes of permutations in the basis B, s is the maximal size of a pin-permutation in B and k is the number of pin-permutations in B.
Fichier principal
Vignette du fichier
1307.2006.pdf (950.55 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01818308 , version 1 (05-03-2024)

Identifiers

Cite

Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Dominique Rossin. An algorithm for deciding the finiteness of the number of simple permutations in permutation classes. Advances in Applied Mathematics, 2015, 64, pp.124 - 200. ⟨10.1016/j.aam.2014.12.001⟩. ⟨hal-01818308⟩
157 View
2 Download

Altmetric

Share

Gmail Facebook X LinkedIn More