Pages that link to "Item:Q1279660"
From MaRDI portal
The following pages link to The solution of a conjecture of Stanley and Wilf for all layered patterns (Q1279660):
Displaying 14 items.
- Excluded permutation matrices and the Stanley-Wilf conjecture (Q598446) (← links)
- Sorting with networks of data structures (Q602673) (← links)
- Counting permutations by their rigid patterns (Q696917) (← links)
- Shape avoiding permutations (Q1604576) (← links)
- A new class of Wilf-equivalent permutations (Q1604771) (← links)
- Finite automata and pattern avoidance in words (Q1775550) (← links)
- Quasirandom permutations (Q1826859) (← links)
- A simple proof for the exponential upper bound for some tenacious patterns (Q1883399) (← links)
- On the number of permutations avoiding a given pattern (Q1971017) (← links)
- Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind (Q1972357) (← links)
- Asymptotic enumeration of permutations avoiding generalized patterns (Q2490025) (← links)
- Large Deviations and Ratio Limit Theorems for Pattern-Avoiding Permutations (Q5410254) (← links)
- Restricted 132-avoiding permutations (Q5933473) (← links)
- The number of inversions of permutations with fixed shape (Q6156003) (← links)
