We establish parity theorems for statistics on the symmetric group Sn, the derangements Dn, and the Catalan words Cn, giving both algebraic and bijective proofs. For the former, we evaluate q-generating functions at q = −1; for the latter, we define appropriate signreversing involutions. Most of the statistics involve counting inversions or finding the major index of various words
In this paper we refine the well-known permutation statistic “descent ” by fixing parity of (exactly...
In this paper we refine the well-known permutation statistic “descent” by fixing parity of (exactly)...
We call a function on permutations {\em $k$-local} if it is a linear combination of indicator functi...
A q-generalization Gn(q) of a combinatorial sequence Gn which reduces to that sequence when q = 1 is...
A q-generalization Gn(q) of a combinatorial sequence Gn which reduces to that sequence when q = 1 is...
AbstractWe introduce a natural extension of Adin, Brenti, and Roichman’s major-index statistic nmaj ...
AbstractThe Catalan numbers occur ubiquitously in combinatorics. R. Stanley’s book Enumerative Combi...
AbstractNatural q analogues of classical statistics on the symmetric groups Sn are introduced; param...
AbstractLet Sn denote the symmetric group of all permutations of {1,2,…,n} and let S=∪n≥0Sn. If Π⊆S ...
AbstractWe derive multivariate generating functions that count signed permutations by various statis...
AbstractWe derive multivariate generating functions that count signed permutations by various statis...
AbstractIn this paper we look at polynomials arising from statistics on the classes of involutions, ...
AbstractWe define new Mahonian statistics, called MAD, MAK, and ENV, on words. Of these, ENV is show...
AbstractLet An⊆Sn denote the alternating and the symmetric groups on 1,…,n. MacMahon's theorem [P.A....
Stasinski A, Voll C. A New Statistic on the Hyperoctahedral Groups. The Electronic Journal of Combin...
In this paper we refine the well-known permutation statistic “descent ” by fixing parity of (exactly...
In this paper we refine the well-known permutation statistic “descent” by fixing parity of (exactly)...
We call a function on permutations {\em $k$-local} if it is a linear combination of indicator functi...
A q-generalization Gn(q) of a combinatorial sequence Gn which reduces to that sequence when q = 1 is...
A q-generalization Gn(q) of a combinatorial sequence Gn which reduces to that sequence when q = 1 is...
AbstractWe introduce a natural extension of Adin, Brenti, and Roichman’s major-index statistic nmaj ...
AbstractThe Catalan numbers occur ubiquitously in combinatorics. R. Stanley’s book Enumerative Combi...
AbstractNatural q analogues of classical statistics on the symmetric groups Sn are introduced; param...
AbstractLet Sn denote the symmetric group of all permutations of {1,2,…,n} and let S=∪n≥0Sn. If Π⊆S ...
AbstractWe derive multivariate generating functions that count signed permutations by various statis...
AbstractWe derive multivariate generating functions that count signed permutations by various statis...
AbstractIn this paper we look at polynomials arising from statistics on the classes of involutions, ...
AbstractWe define new Mahonian statistics, called MAD, MAK, and ENV, on words. Of these, ENV is show...
AbstractLet An⊆Sn denote the alternating and the symmetric groups on 1,…,n. MacMahon's theorem [P.A....
Stasinski A, Voll C. A New Statistic on the Hyperoctahedral Groups. The Electronic Journal of Combin...
In this paper we refine the well-known permutation statistic “descent ” by fixing parity of (exactly...
In this paper we refine the well-known permutation statistic “descent” by fixing parity of (exactly)...
We call a function on permutations {\em $k$-local} if it is a linear combination of indicator functi...
DOI
Add to ORKG