Pages that link to "Item:Q1003625"
From MaRDI portal
The following pages link to Asymptotic bounds for permutations containing many different patterns (Q1003625):
Displaying 14 items.
- Waiting time distribution for the emergence of superpatterns (Q292369) (← links)
- The maximal length of a \(k\)-separator permutation (Q405306) (← links)
- Patterns in colored circular permutations (Q1639631) (← links)
- Universal layered permutations (Q1658771) (← links)
- Lower bounds for superpatterns and universal sequences (Q2037175) (← links)
- Supertrees (Q2181994) (← links)
- Bounds on superpatterns containing all layered permutations (Q2354608) (← links)
- Prolific permutations and permuted packings: downsets containing many large patterns (Q2403721) (← links)
- Rationality for subclasses of 321-avoiding permutations (Q2422212) (← links)
- Universality of random permutations (Q3300092) (← links)
- Containing All Permutations (Q5144492) (← links)
- (Q5383238) (← links)
- Quasipolynomiality of the Smallest Missing Induced Subgraph (Q6051910) (← links)
- An asymptotically tight lower bound for superpatterns with small alphabets (Q6179325) (← links)
