Pages that link to "Item:Q2474234"
From MaRDI portal
The following pages link to Simple permutations: Decidability and unavoidable substructures (Q2474234):
Displaying 14 items.
- Boundary properties of well-quasi-ordered sets of graphs (Q382896) (← links)
- An algorithm computing combinatorial specifications of permutation classes (Q526814) (← links)
- Substitution-closed pattern classes (Q618290) (← 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)
- Scaling limits of permutation classes with a finite specification: a dichotomy (Q2155196) (← links)
- Universal limits of substitution-closed permutation classes (Q2216743) (← links)
- An algorithm for deciding the finiteness of the number of simple permutations in permutation classes (Q2255003) (← links)
- The enumeration of permutations avoiding 3124 and 4312 (Q2363494) (← links)
- Decomposing simple permutations, with enumerative consequences (Q2377669) (← links)
- WQO is decidable for factorial languages (Q2407108) (← links)
- Simple permutations and algebraic generating functions (Q2426423) (← links)
- Labelled well-quasi-order for permutation classes (Q5051473) (← links)
- An exact characterization of saturation for permutation matrices (Q5886259) (← links)
