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

Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01818308
Contributor : Loïc Paulevé <>
Submitted on : Monday, June 18, 2018 - 11:42:23 PM
Last modification on : Tuesday, April 2, 2019 - 1:45:14 AM

Links full text

Identifiers

Citation

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, Elsevier, 2015, 64, pp.124 - 200. ⟨10.1016/j.aam.2014.12.001⟩. ⟨hal-01818308⟩

Share

Metrics

Record views

135