Pages that link to "Item:Q2915601"
From MaRDI portal
The following pages link to Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial (Q2915601):
Displaying 5 items.
- An algorithm computing combinatorial specifications of permutation classes (Q526814) (← links)
- Restricted permutations and the wreath product (Q1861200) (← links)
- An algorithm for deciding the finiteness of the number of simple permutations in permutation classes (Q2255003) (← links)
- Wreath products of permutation classes (Q2372890) (← links)
- Automatic discovery of structural rules of permutation classes (Q4629385) (← links)