Statistics on wreath products and generalized binomial-Stirling numbers
type: Item
instance of: scholarly article
title: Statistics on wreath products and generalized binomial-Stirling numbers
zbMATH Open document ID: 1126.05008
DOI: 10.1007/BF02777362
author: Amitai Regev
author: Yuval Roichman
published in: Israel Journal of Mathematics
publication date: 2007-10-09T00:00:00Z
full work available at URL: https://arxiv.org/abs/math/0404354
review text: Fix four integers \(a,d,r,\ell\) and let \(g(n,k)=g_{a,d,r,\ell}(n,k) \) be the numbers defined by the recurrence \(g(0,0)=1\) and \(g(n,k)=(an+dk-r)\cdot g(n-1,k)+\ell \cdot g(n-1,k-1) \) and \(g(n,k)=0\) if \(k<0\) or \(n>k\). These numbers are common generalizations of the binomial coefficients and the Stirling numbers. For example \(g_{1,0,1,1}(n,k) \) are the signless Stirling numbers of the first kind, \(g_{0,1,0,1}(n,k) \) are the Stirling numbers of the second kind, and \(g_{0,0,-1,1}(n,k) \) are the binomial coefficients. Several sequences introduces in the paper fall into this general recurrence relation. The paper studies canonical presentations in wreath products and introduce statistics counting the number of ``long'' and ``short'' factors in these presentations. These numbers essentially count the number of certain right to left minima in colored permutations. It is shown that enumeration of elements in wreath products with respect to these (and to these and descent) statistics have nice recurrence formulas of binomial-Stirling type. In particular a wreath product extension of the Stirling numbers of the first and second kind is given and a MacMahon-type equidistribution theorem is shown.
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 11B73
zbMATH DE Number: 5198524
zbMATH Keywords: Stirling numbers
zbMATH Keywords: wreath product
zbMATH Keywords: permutation statistics
zbMATH Keywords: colored permutations
zbMATH Keywords: flag major index
zbMATH Keywords: MacMahon type equidistribution theorems
reviewed by: László A. Székely
MaRDI profile type: MaRDI publication profile
arXiv ID: math/0404354
cites work: Descent representations and multivariate statistics
cites work: Signed Mahonians
cites work: The flag major index and group actions on polynomial rings.
cites work: Euler-Mahonian parameters on colored permutation groups
cites work: Permutation statistics and linear extensions of posets
cites work: Permutation statistics and partitions
cites work: Statistics on wreath products, perfect matchings, and signed words
cites work: Q3283895
cites work: Inversion Properties of Triangular Arrays of Numbers
cites work: A characterization of inverse relations.
cites work: Recursively defined combinatorial functions: Extending Galton's board
cites work: Enumeration of permutations by descents, idescents, imajor index, and basic components
cites work: Permutation statistics on the alternating group
cites work: Generalized statistics on \(S_{n}\) and pattern avoidance
cites work: Q4324964
description: scientific article