Pages that link to "Item:Q1865264"
From MaRDI portal
The following pages link to Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations (Q1865264):
Displaying 19 items.
- Refining enumeration schemes to count according to permutation statistics (Q405263) (← links)
- The Matrix Ansatz, orthogonal polynomials, and permutations (Q534191) (← links)
- Rook placements in Young diagrams and permutation enumeration (Q544130) (← links)
- A short proof for the number of permutations containing pattern 321 exactly once (Q640473) (← links)
- Counting occurrences of 132 in a permutation (Q696855) (← links)
- Counting permutations by their rigid patterns (Q696917) (← links)
- New permutation statistics: Variation and a variant (Q1026169) (← links)
- Equidistributions of Mahonian statistics over pattern avoiding permutations (Q1691101) (← links)
- Counting occurrences of 132 in an even permutation (Q1774751) (← links)
- The patterns of permutations (Q1850035) (← links)
- Some multivariate master polynomials for permutations, set partitions, and perfect matchings, and their continued fractions (Q2133993) (← links)
- Decomposing simple permutations, with enumerative consequences (Q2377669) (← links)
- Bijections for permutation tableaux (Q2519814) (← links)
- Crossings and alignments of permutations (Q2643865) (← links)
- Applying the cluster method to count occurrences of generalized permutation patterns (Q3016321) (← links)
- Permutations, Moments, Measures (Q5004541) (← links)
- Lattice path enumeration of permutations with \(k\) occurrences of the pattern 2--13 (Q5395446) (← links)
- Recurrence relations for patterns of type (2,1) in flattened permutations (Q5746468) (← links)
- The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group (Q6097068) (← links)
