Pages that link to "Item:Q2891969"
From MaRDI portal
The following pages link to Counting permutations by numbers of excedances, fixed points and cycles (Q2891969):
Displaying 16 items.
- Rook theory and cycle-counting permutation statistics (Q705229) (← links)
- The largest and the smallest fixed points of permutations (Q976162) (← links)
- The excedance set of a permutation (Q1586921) (← links)
- Proof of conjecture of Ehrenborg and Steingrímsson on excedance statistic (Q1612764) (← links)
- Counting orbits of a product of permutations (Q1813986) (← links)
- Excedance numbers for the permutations of type \(B\) (Q1953513) (← links)
- Finding and counting permutations via CSPs (Q2041985) (← links)
- Some multivariate master polynomials for permutations, set partitions, and perfect matchings, and their continued fractions (Q2133993) (← links)
- (Q2993499) (← links)
- (Q3023992) (← links)
- (Q3077263) (← links)
- Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem (Q3801557) (← links)
- Application of a combinatorial identity in the enumeration of combinations that are invariant with respect to substitution (Q4722078) (← links)
- An Unusual Recursive Formula to Answer a Question Regarding Fixed Points in Permutations (Q4956281) (← links)
- Counting Multiple Cyclic Choices Without Adjacencies (Q5316118) (← links)
- A counting scheme and some algebraic properties of a class of special permutation patterns (Q5446258) (← links)
