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

Dates and versions

hal-01818308 , version 1 (18-06-2018)

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⟩
132 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More