AbstractGarsia (1988) gives a remarkably simple expression for the major index enumerator for permutations of a fixed cycle type evaluated at a primitive root of unity. He asks for a direct combinatorial proof of this identity. Here we give such a combinatorial derivation
We present a new proof of the well-known combinatorial result [nk]q = [Sigma]w qMaj(w) where w is a ...
AbstractThe number of permutations with given cycle structure and descent set is shown to be equal t...
The cycle polynomial of a finite permutation group G is the generating function for the number of el...
AbstractGarsia (1988) gives a remarkably simple expression for the major index enumerator for permut...
AbstractThe cycle index polynomial of combinatorial analysis is discussed in various contexts
AbstractA new and useful operation on permutation groups is defined and studied. A formula for the c...
AbstractWe present a new proof of the well-known combinatorial result [nk]q = Σw qMaj(w) where w is ...
AbstractMultivariable extensions of classic permutation cycle structure results are obtained by coun...
AbstractThe definitions of descent, excedance, major index, inversion index and Denert's statistics ...
AbstractThe group algebra of the symmetric group is used to derive a general enumerative result asso...
AbstractA permutation of n objects is of cycle type (j1,…,jn) if it has jk, k=1,…,n, cycles of lengt...
AbstractLet G be a finite group. To each permutation representation (G, X) of G and each class funct...
AbstractA multivariate generating function involving the descent, major index, and inversion statist...
Abstract. We give a new expression for the number of factorizations of a full cycle into an ordered ...
AbstractLet (G, D) be a permutation representation of a finite group G acting on a finite set D. The...
We present a new proof of the well-known combinatorial result [nk]q = [Sigma]w qMaj(w) where w is a ...
AbstractThe number of permutations with given cycle structure and descent set is shown to be equal t...
The cycle polynomial of a finite permutation group G is the generating function for the number of el...
AbstractGarsia (1988) gives a remarkably simple expression for the major index enumerator for permut...
AbstractThe cycle index polynomial of combinatorial analysis is discussed in various contexts
AbstractA new and useful operation on permutation groups is defined and studied. A formula for the c...
AbstractWe present a new proof of the well-known combinatorial result [nk]q = Σw qMaj(w) where w is ...
AbstractMultivariable extensions of classic permutation cycle structure results are obtained by coun...
AbstractThe definitions of descent, excedance, major index, inversion index and Denert's statistics ...
AbstractThe group algebra of the symmetric group is used to derive a general enumerative result asso...
AbstractA permutation of n objects is of cycle type (j1,…,jn) if it has jk, k=1,…,n, cycles of lengt...
AbstractLet G be a finite group. To each permutation representation (G, X) of G and each class funct...
AbstractA multivariate generating function involving the descent, major index, and inversion statist...
Abstract. We give a new expression for the number of factorizations of a full cycle into an ordered ...
AbstractLet (G, D) be a permutation representation of a finite group G acting on a finite set D. The...
We present a new proof of the well-known combinatorial result [nk]q = [Sigma]w qMaj(w) where w is a ...
AbstractThe number of permutations with given cycle structure and descent set is shown to be equal t...
The cycle polynomial of a finite permutation group G is the generating function for the number of el...
DOI
Add to ORKG