Pages that link to "Item:Q2377669"
From MaRDI portal
The following pages link to Decomposing simple permutations, with enumerative consequences (Q2377669):
Displaying 11 items.
- Substitution-closed pattern classes (Q618290) (← links)
- Grid classes and partial well order (Q645965) (← links)
- Small configurations in simple permutations (Q709247) (← links)
- Almost avoiding permutations (Q1045202) (← 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)
- A counterexample regarding labelled well-quasi-ordering (Q1756107) (← links)
- Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile (Q1953475) (← links)
- Scaling limits of permutation classes with a finite specification: a dichotomy (Q2155196) (← links)
- An algorithm for deciding the finiteness of the number of simple permutations in permutation classes (Q2255003) (← links)
- Simple permutations: Decidability and unavoidable substructures (Q2474234) (← links)
