Pages that link to "Item:Q696855"
From MaRDI portal
The following pages link to Counting occurrences of 132 in a permutation (Q696855):
Displaying 14 items.
- The shape of random pattern-avoiding permutations (Q401507) (← links)
- Small configurations in simple permutations (Q709247) (← links)
- Restricted \(k\)-ary words and functional equations (Q1028452) (← links)
- Almost avoiding permutations (Q1045202) (← links)
- On the diagram of 132-avoiding permutations (Q1405003) (← links)
- Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three (Q1408270) (← links)
- Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations (Q1865264) (← links)
- On Stanley-Wilf limit of the pattern 1324 (Q2048379) (← links)
- Decomposing simple permutations, with enumerative consequences (Q2377669) (← links)
- Counting occurrences of 231 in an involution (Q2488929) (← links)
- (Q5197595) (← links)
- Recurrence relations in counting the pattern 13-2 in flattened permutations (Q5248187) (← links)
- Recurrence relations for patterns of type (2,1) in flattened permutations (Q5746468) (← links)
- Subsequence frequency in binary words (Q6204345) (← links)
