The following pages link to Counting permutations by runs (Q285069):
Displaying 16 items.
- Subalgebras of Solomon's descent algebra based on alternating runs (Q721042) (← links)
- Shuffle-compatible permutation statistics (Q1639637) (← links)
- Jacobian elliptic functions and a family of bivariate peak polynomials (Q2048351) (← links)
- A lifting of the Goulden-Jackson cluster method to the Malvenuto-Reutenauer algebra (Q2109230) (← links)
- Plethystic formulas for permutation enumeration (Q2213771) (← links)
- An asymptotic distribution theory for Eulerian recurrences with applications (Q2280063) (← links)
- David-Barton type identities and alternating run polynomials (Q2300578) (← links)
- Homomorphisms on noncommutative symmetric functions and permutation enumeration (Q2306530) (← links)
- \(\gamma\)-positivity and partial \(\gamma\)-positivity of descent-type polynomials (Q2318485) (← links)
- Hopping from Chebyshev polynomials to permutation statistics (Q2318774) (← links)
- Eulerian polynomials and descent statistics (Q2363310) (← links)
- Triangular recurrences, generalized Eulerian numbers, and related number triangles (Q2689163) (← links)
- The Dumont ansatz for the Eulerian polynomials, peak polynomials and derivative polynomials (Q6065690) (← links)
- A grammatical calculus for peaks and runs of permutations (Q6098207) (← links)
- Stirling permutation codes (Q6111263) (← links)
- Positivity of Narayana polynomials and Eulerian polynomials (Q6138054) (← links)
