Basic calculus of signed permutations. I: Length and number of inversions
type: Item
instance of: scholarly article
title: Basic calculus of signed permutations. I: Length and number of inversions
zbMATH Open document ID: 0870.05001
author: Guo-Niu Han
author: Dominique Foata
published in: Advances in Applied Mathematics
publication date: 1997-08-28T00:00:00Z
review text: Several investigators (e.g., F. Brenti, J. Stembridge, V. Reiner) have calculated the exponential generating function for the sequence of polynomials \(\{W_n(X,Y,t)\}\) where each \(W_n(X,Y,t)\) gives the trivariate distribution on signed permutations of descent number with the number of letters of each sign: \[ \frac{(1-t)\exp ((t-1)X)}{-t+\exp ((t-1)(X+Y))}=\sum\limits_{n\geq 0}\frac 1{n!}W_n(X,Y,t). \] \textit{V. Reiner} [Discrete Math. 140, No. 1-3, 129-140 (1995; Zbl 0830.20025)] has calculated a \(q\)-analogue whose coefficients are combinatorially interpreted as the polynomial generating functions for descent number and Coxeter length. In this article, the authors offer different \(q\)-analogues of the formula above by replacing the ordinary exponential function first by the \(q\)-exponential \(e_q(u)=\frac 1{(u;q)_\infty }\), then by the \(Q\)-exponential \( E_Q(u)=(-u;Q)_\infty .\) The new coefficients are again generating polynomials for certain pairs of statistics on signed permutations, namely (des, coinv) and (des, inv). (Note: the ``inv'' of this paper is not the same as Coxeter length.) More generally, replacing the ordinary exponential function by a multibasic Bessel function leads to polynomial generating functions on ``signed multipermutations of order \(n\)''. The statistics of interest are natural generalizations of ``des'', ``inv'' and ``coinv''. The \( q\)- and \(Q\)-analogues described earlier are obtained as specializations of this result, as are several other well-known formulas. The proof of the main theorem is accomplished using an iterative procedure to show that the desired polynomial generating functions satisfy the correct recurrence. The same procedure is also used to give a different proof of Reiner's result. In a subsequent article [Electron. J. Comb. 4, No. 2, R5 (1997)], the authors extend their main result in a different way, using finite analogues of Bessel functions.
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 05A05
zbMATH DE Number: 1016988
zbMATH Keywords: permutation statistics
zbMATH Keywords: generating functions
zbMATH Keywords: signed permutations
zbMATH Keywords: Bessel functions
zbMATH Keywords: \(q\)-analogue
reviewed by: Jennifer R.Galovich
MaRDI profile type: Publication
full work available at URL: aama.1997.0525
OpenAlex ID: W2068444462
cites work: Q4146776
cites work: \(q\)-Eulerian polynomials arising from Coxeter groups
cites work: q-Bernoulli and Eulerian Numbers
cites work: Eulerian Numbers and Polynomials
cites work: A Combinatorial Property of q-Eulerian Numbers
cites work: Enumeration of pairs of permutations
cites work: Eulerian calculus. II: An extension of Han's fundamental transformation
cites work: Q5820721
cites work: On the Bessel functions
cites work: Adjacencies in words
cites work: Basic calculus of signed permutations. II: Finite analogues of Bessel functions
cites work: Multibasic Eulerian Polynomials
cites work: Q4040884
cites work: A \(q\)-analog of the exponential formula
cites work: The zeros of basic Bessel functions, the functions J(nu+ax)(x), and associated orthogonal polynomials
cites work: Signed permutation statistics
cites work: Signed permutation statistics and cycle type
cites work: Upper binomial posets and signed permutation statistics
cites work: Descents and one-dimensional characters for classical Weyl groups
cites work: The distribution of descents and length in a Coxeter group
cites work: Binomial posets, Möbius inversion, and permutation enumeration
cites work: Permutation statistics of indexed permutations
cites work: Eulerian numbers, tableaux, and the Betti numbers of a toric variety
cites work: A lattice walk approach to the ''inv'' and ''maj'' q-counting of multiset permutations
DOI: 10.1006/AAMA.1997.0525
description: scientific article; zbMATH DE number 1016988