Permutations by Number of Rises and Successions
From MaRDI portal
Publication:5542801
Cites work
Cited in
(34)- A Formal Calculus for the Enumerative System of Sequences-I. Combinatorial Theorems
- A Formal Calculus for the Enumerative System of Sequences-II. Applications
- A Formal Calculus for the Enumerative System of Sequences-III. Further Developments
- The \(q\)-tangent and \(q\)-secant numbers via basic Eulerian polynomials
- A q-enumeration of alternating permutations
- The q-tangent and q-secant numbers via continued fractions
- The distribution of increasing 2-sequences in random permutations of arbitrary multi-sets.
- Counting Successions in Permutations
- A new decomposition of derangements
- Some stochastic processes in a random permutation
- Signed countings of types B and D permutations and \(t,q\)-Euler numbers
- A combinatorial interpretation of the Seidel generation of \(q\)-derangement numbers
- Derangements and Genocchi numbers
- The pruning-grafting lattice of binary trees
- Some permutation problems
- On the joint distributions of succession and Eulerian statistics
- Distributions of successions of arbitrary multisets
- A grammar of Dumont and a theorem of Diaconis-Evans-Graham
- A unified approach to polynomial sequences with only real zeros
- Counting permutations by the number of successions within cycles
- A generalization of the Eulerian numbers with a probabilistic application
- Generalized Eulerian polynomials with a nonnegative gamma vector
- Fixed points and adjacent ascents for classical complex reflection groups
- Counting permutations by successions and other figures
- Permutations and successions
- Circular permutations by number of rises and successions
- A NOTE ON SAMPLING WITH AND WITHOUT REPLACEMENT
- The \(1/k\)-Eulerian polynomials of type \(B\)
- Permanent identities, combinatorial sequences, and permutation statistics
- Hopping from Chebyshev polynomials to permutation statistics
- On the exact distributions of Eulerian and Simon Newcomb numbers associated with random permutations
- Sequence enumeration
- The distribution of increasing l-sequences in random permutations: A Markov chain approach
- Generalized Eulerian numbers
This page was built for publication: Permutations by Number of Rises and Successions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5542801)