Enumeration of permutations by descents, idescents, imajor index, and basic components
From MaRDI portal
Publication:595655
Cites work
- A q-analog of the exponential formula
- A combinatorial interpretation of q-derangement and q-Laguerre numbers
- A simple solution of Simon Newcomb's problem
- Binomial posets, Möbius inversion, and permutation enumeration
- Enumeration of permutations by rises and cycle structure.
- Generalized Worpitzky identities with applications to permutation enumeration
- scientific article; zbMATH DE number 3577263 (Why is no real title available?)
- scientific article; zbMATH DE number 3433888 (Why is no real title available?)
- On the Foundations of Combinatorial Theory V, Eulerian Differential Operators
- On the Netto Inversion Number of a Sequence
- Permutation statistics and partitions
- The (qr)-Simon Newcomb problem
- The q-Stirling numbers of first and second kinds
Cited in
(11)- Some stochastic processes in a random permutation
- Permutation statistics and linear extensions of posets
- A binary tree decomposition space of permutation statistics
- A central limit theorem for a new statistic on permutations
- Statistics on wreath products and generalized binomial-Stirling numbers
- 𝑞-Eulerian polynomials: Excedance number and major index
- Computing the distribution of a combinatorial statistics defined on permutations of a given multiset
- Eulerian quasisymmetric functions
- The Eulerian distribution on the fixed-point free involutions of the hyperoctahedral group under the natural order
- Lattice paths related to descents and inverse descents in hyperoctahedral groups
- Multicolored permutations, sequences, and tableaux
This page was built for publication: Enumeration of permutations by descents, idescents, imajor index, and basic components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q595655)