Basic calculus of signed permutations. I: Length and number of inversions
From MaRDI portal
Publication:1356118
DOI10.1006/aama.1997.0525zbMath0870.05001OpenAlexW2068444462MaRDI QIDQ1356118
Publication date: 28 August 1997
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/aama.1997.0525
Related Items
Euler-Mahonian polynomials for \(C_{a}\wr S_{n}\) ⋮ Signed Mahonians ⋮ Descent numbers and major indices for the hyperoctahedral group
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A lattice walk approach to the inv and maj q-counting of multiset permutations
- The zeros of basic Bessel functions, the functions J(nu+ax)(x), and associated orthogonal polynomials
- A \(q\)-analog of the exponential formula
- Eulerian numbers, tableaux, and the Betti numbers of a toric variety
- Enumeration of pairs of permutations
- Binomial posets, Möbius inversion, and permutation enumeration
- Permutation statistics of indexed permutations
- Signed permutation statistics
- Signed permutation statistics and cycle type
- Upper binomial posets and signed permutation statistics
- \(q\)-Eulerian polynomials arising from Coxeter groups
- Basic calculus of signed permutations. II: Finite analogues of Bessel functions
- Descents and one-dimensional characters for classical Weyl groups
- Eulerian calculus. II: An extension of Han's fundamental transformation
- Adjacencies in words
- The distribution of descents and length in a Coxeter group
- Eulerian Numbers and Polynomials
- Multibasic Eulerian Polynomials
- A Combinatorial Property of q-Eulerian Numbers
- q-Bernoulli and Eulerian Numbers
- On the Bessel functions