Pages that link to "Item:Q2255003"
From MaRDI portal
The following pages link to An algorithm for deciding the finiteness of the number of simple permutations in permutation classes (Q2255003):
Displayed 5 items.
- An algorithm computing combinatorial specifications of permutation classes (Q526814) (← links)
- Characterising inflations of monotone grid classes of permutations (Q1679336) (← links)
- Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs (Q1730221) (← links)
- Universal limits of substitution-closed permutation classes (Q2216743) (← links)
- Automatic discovery of structural rules of permutation classes (Q4629385) (← links)