Pages that link to "Item:Q1971017"
From MaRDI portal
The following pages link to On the number of permutations avoiding a given pattern (Q1971017):
Displaying 16 items.
- Pattern avoidance in poset permutations (Q304187) (← links)
- A probabilistic approach to consecutive pattern avoiding in permutations (Q385031) (← links)
- Degrees of nonlinearity in forbidden 0-1 matrix problems (Q409347) (← links)
- Excluded permutation matrices and the Stanley-Wilf conjecture (Q598446) (← links)
- Restricted \(k\)-ary words and functional equations (Q1028452) (← links)
- Shape avoiding permutations (Q1604576) (← links)
- Finite automata and pattern avoidance in words (Q1775550) (← links)
- Quasirandom permutations (Q1826859) (← links)
- Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations (Q1865264) (← links)
- A simple proof for the exponential upper bound for some tenacious patterns (Q1883399) (← links)
- Pattern occurrences in \(k\)-ary words revisited: a few new and old observations (Q2077272) (← links)
- Forbidden paths and cycles in ordered graphs and matrices (Q2472738) (← links)
- Counting occurrences of 231 in an involution (Q2488929) (← links)
- Asymptotic enumeration of permutations avoiding generalized patterns (Q2490025) (← links)
- On avoiding 1233 (Q5045252) (← links)
- Large Deviations and Ratio Limit Theorems for Pattern-Avoiding Permutations (Q5410254) (← links)
