Pages that link to "Item:Q1408270"
From MaRDI portal
The following pages link to Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three (Q1408270):
Displaying 13 items.
- Bijections for refined restricted permutations (Q598452) (← links)
- A history and a survey of lattice path enumeration (Q972828) (← links)
- A solution to one of Knuth's permutation problems (Q990192) (← links)
- Almost avoiding permutations (Q1045202) (← links)
- On the diagram of 132-avoiding permutations (Q1405003) (← links)
- On the distribution of the number of occurrences of an order-preserving pattern of length three in a random permutation (Q1930607) (← links)
- The generalized lucky ticket problem, perfect matchings, and closure relations satisfied by the Chebyshev and \(q\)-Hermite polynomials (Q2346598) (← links)
- Decomposing simple permutations, with enumerative consequences (Q2377669) (← links)
- Counting occurrences of 231 in an involution (Q2488929) (← links)
- A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations (Q2494390) (← links)
- Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polyno\-mials (Q2581411) (← links)
- Chains of maximum length in the Tamari lattice (Q3190318) (← links)
- Subsequence frequency in binary words (Q6204345) (← links)
