An algorithm for deciding the finiteness of the number of simple permutations in permutation classes-Reference-Cited by-同舟云学术

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

Published:2015-03 Issue: Volume:64 Page:124-200
ISSN:0196-8858
Container-title:Advances in Applied Mathematics
language:en
Short-container-title:Advances in Applied Mathematics

Author:

Bassino Frédérique,Bouvel Mathilde,Pierrot Adeline,Rossin Dominique

Funder

ANR

Publisher

Elsevier BV

Subject

Applied Mathematics

Reference18 articles.

1. Efficient string matching: an aid to bibliographic search;Aho;Commun. ACM,1975

2. Algorithms for pattern involvement in permutations;Albert,2001

3. Simple permutations and pattern restricted permutations;Albert;Discrete Math.,2005

4. Combinatorial specification of permutation classes;Bassino,2012

5. Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial;Bassino;Pure Math. Appl. (PU.M.A.),2010

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Universal limits of substitution-closed permutation classes;Journal of the European Mathematical Society;2020-08-04

2. Growth rates of permutation classes: from countable to uncountable;Proceedings of the London Mathematical Society;2019-05-09

3. Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs;Discrete Applied Mathematics;2019-03

4. Automatic discovery of structural rules of permutation classes;Mathematics of Computation;2018-12-11

5. Characterising inflations of monotone grid classes of permutations;Journal of Combinatorial Theory, Series A;2018-02