MacMahon's classic theorem states that the 'length' and 'major index' statistics are equidistributed on the symmetric group S_n. By defining natural analogues or generalizations of those statistics, similar equidistribution results have been obtained for the alternating group A_n by Regev and Roichman, for the hyperoctahedral group B_n by Adin, Brenti and Roichman, and for the group of even-signed permutations D_n by Biagioli. We prove analogues of MacMahon's equidistribution theorem for the group of signed even permutations and for its subgroup of even-signed even permutations.
We report on findings of a variant of ${\texttt{IdentityFinder}}$ - a Maple program that was used by two of the authors to conjecture several new identities of Rogers-Ramanujan kind. In the present search, we modify the parametrization of the search space by taking into consideration several aspects of Lepowsky and Wilson's $Z$-algebraic mechanism and its variant by Meurman and Primc. We search for identities based on forbidding the appearance of "flat" partitions as sub-partitions. Several new identities of Rogers-Ramanujan-MacMahon type are found and proved.
A classical result of MacMahon gives a simple product formula for the generating function of major index over the symmetric group. A similar factorial-type product formula for the generating function of major index together with sign was given by Gessel and Simion. Several extensions are given in this paper, including a recurrence formula, a specialization at roots of unity and type $B$ analogues.
We study signed differential posets, a signed version of differential posets. These posets satisfy enumerative identities which are signed analogues of those satisfied by differential posets. Our main motivations are the sign-imbalance identities for partition shapes originally conjectured by Stanley, now proven by Lam, Reifergerste and Sjostrand. We show that these identities result from a signed differential poset structure on Young's lattice, and explain similar identities for Fibonacci shapes.
Signed Counting on Restricted Partitions and Combinatorial Proofs of Three Identities
College of Mathematics and Statistics & Center for Discrete Mathematics, Chongqing University（重庆大学数学与统计学院与离散数学中心）；College of Mathematics and Statistics, Chongqing University（重庆大学数学与统计学院）
A relationship between signed Eulerian polynomials and the classical Eulerian polynomials on $\mathfrak{S}_n$ was given by Désarménien and Foata in 1992, and a refined version, called signed Euler-Mahonian identity, together with a bijective proof were proposed by Wachs in the same year. By generalizing this bijection, in this paper we extend the above results to the Coxeter groups of types $B_n$, $D_n$, and the complex reflection group $G(r,1,n)$, where the `sign' is taken to be any one-dimensional character. Some obtained identities can be further restricted on some particular set of permuta…
The right-quantum algebra was introduced recently by Garoufalidis, Lê and Zeilberger in their quantum generalization of the MacMahon master theorem. A combinatorial proof of this identity due to Konvalinka and Pak, and also the recent proof of the right-quantum Sylvester's determinant identity, make heavy use of a bijection related to the first fundamental transformation on words introduced by Foata. This paper makes explicit the connection between this transformation and right-quantum linear algebra identities; applications include a new combinatorial proof of the right-quantum matrix inverse…
We derive several identities that feature irreducible characters of the general linear, the symplectic, the orthogonal, and the special orthogonal groups. All the identities feature characters that are indexed by shapes that are "nearly" rectangular, by which we mean that the shapes are rectangles except for one row or column that might be shorter than the others. As applications we prove new results in plane partitions and tableaux enumeration, including new refinements of the Bender-Knuth and MacMahon (ex-)conjectures.
The permanent is pivotal to both complexity theory and combinatorics. In quantum computing, the permanent appears in the expression of output amplitudes of linear optical computations, such as in the Boson Sampling model. Taking advantage of this connection, we give quantum-inspired proofs of many existing as well as new remarkable permanent identities. Most notably, we give a quantum-inspired proof of the MacMahon master theorem as well as proofs for new generalizations of this theorem. Previous proofs of this theorem used completely different ideas. Beyond their purely combinatorial applicat…
A classical result of MacMahon shows that the length function and the major index are equi-distributed over the symmetric group. Foata and Schützenberger gave a remarkable refinement and proved that these parameters are equi-distributed over inverse descent classes, implying bivariate equi-distribution identities. Type $B$ analogues of these results, refinements and consequences are given in this paper.
Five simple guidelines are proposed to compute the generating function for the nonnegative integer solutions of a system of linear inequalities. In contrast to other approaches, the emphasis is on deriving recurrences. We show how to use the guidelines strategically to solve some nontrivial enumeration problems in the theory of partitions and compositions. This includes a strikingly different approach to lecture hall-type theorems, with new $q$-series identities arising in the process. For completeness, we prove that the guidelines suffice to find the generating function for any system of homo…
We prove several identities expressing polynomials counting permutations by various descent statistics in terms of Eulerian polynomials, extending results of Stembridge, Petersen, and Brändén. Additionally, we find $q$-exponential generating functions for $q$-analogues of these descent statistic polynomials that also keep track of the inversion number or inverse major index. We also present identities relating several of these descent statistic polynomials to refinements of type B Eulerian polynomials and flag descent polynomials by the number of negative letters of a signed permutation. Our m…
Central Limit Theorems are known for the Eulerian statistic "descent" (or "excedance") in the symmetric group $\SSS_n$. Recently, Fulman, Kim, Lee and Petersen gave a Central Limit Theorem for "descent" over the alternating group $\AAA_n$ and also gave a Carlitz identity in $\AAA_n$ using descents. In this paper, we give a Central Limit Theorem in $\AAA_n$ involving excedances. We extend these to the positive elements in type B and type D Coxeter groups. Boroweic and Młotkowski enumerated type B descents over $\DD_n$, the type D Coxeter group and gave similar results. We refine their results f…
We describe a method, based on the theory of Macdonald-Koornwinder polynomials, for proving bounded Littlewood identities. Our approach provides an alternative to Macdonald's partial fraction technique and results in the first examples of bounded Littlewood identities for Macdonald polynomials. These identities, which take the form of decomposition formulas for Macdonald polynomials of type $(R,S)$ in terms of ordinary Macdonald polynomials, are $q,t$-analogues of known branching formulas for characters of the symplectic, orthogonal and special orthogonal groups. In the classical limit, our me…
Stirling numbers, which count partitions of a set and permutations in the symmetric group, have found extensive application in combinatorics, geometry, and algebra. We study analogues and q-analogues of these numbers corresponding to the Coxeter group of type B. In particular, we show how they are related to complete homogeneous and elementary symmetric polynomials; demonstrate how they q-count signed partitions and permutations; compute their ordinary, exponential, and q-exponential generating functions; and prove various identities about them. Ordered analogues of the q-Stirling numbers of t…
We consider discretisations of the Macdonald--Mehta integrals from the theory of finite reflection groups. For the classical groups, $\mathrm{A}_{r-1}$, $\mathrm{B}_r$ and $\mathrm{D}_r$, we provide closed-form evaluations in those cases for which the Weyl denominators featuring in the summands have exponents $1$ and $2$. Our proofs for the exponent-$1$ cases rely on identities for classical group characters, while most of the formulas for the exponent-$2$ cases are derived from a transformation formula for elliptic hypergeometric series for the root system $\mathrm{BC}_r$. As a byproduct of o…
