Related papers: Signed Mahonians

Rowland found a matrix product formula for generating functions counting binomial coefficients by their $p$-adic valuations. A natural generalization of binomial coefficients was introduced by Knuth and Wilf defined by a sequence $C$. We…

This is a paper about $c$-functions and Macdonald polynomials. There are $c$-function formulas for $E$-expansions of $P_\lambda$ and $A_{\lambda+\rho}$, principal specializations of $P_\lambda$ and $E_\mu$, for Macdonald's constant term…

A generating function of the number of homomorphisms from the fundamental group of a compact oriented or non-orientable surface without boundary into a finite group is obtained in terms of an integral over a real group algebra. We calculate…

We introduce the Major MacMahon map and show how this map interacts with the pyramid and bipyramid operators. When the Major MacMahon map is applied to the ab-index of a simplicial poset, it yields the q-analogue of n! times the…

We show that the flagged Grothendieck polynomials defined as the generating functions of flagged set-valued tableaux of Knutson-Miller-Yong can be expressed by a Jacobi-Trudi type determinant formula generalizing the work of…

The box product of Mackey functors has been studied extensively in Lewis's notes. As shown in Thevenaz and Webb's paper, a Mackey functor may be identified with a module over a certain algebra, called the Mackey algebra. We aim at…

Gessel's famous Bessel determinant formula gives the generating function of the number of permutations without increasing subsequences of a given length. Ekhad and Zeilberger proposed the challenge of finding a suitable generalization for…

The product of any finite number of factorial Schur functions can be expanded as a $Z[y]$-linear combination of Schur functions. We give a rule for computing the coefficients in such an expansion which generalizes a specialization of the…

It is a classical theorem that the free product of ordered groups is orderable. In this note we show that, using a method of G. Bergman, an ordering of the free product can be constructed in a functorial manner, in the category of ordered…

Motivated by earlier work of P.~A.~MacMahon and recent contributions of T.~Amdeberhan, G.~E.~Andrews, K.~Ono, A.~Singh, and R.~Tauraso on higher-order partition enumerants, we study a class of $q$-series arising from nested divisor…

We compute generating functions for the sum of the real-valued character degrees of the finite general linear and unitary groups, through symmetric function computations. For the finite general linear group, we get a new combinatorial proof…

Many combinatorial generating functions can be expressed as combinations of symmetric functions, or extracted as sub-series and specializations from such combinations. Gessel has outlined a large class of symmetric functions for which the…

A century ago, P. A. MacMahon introduced two families of generating functions, $$ \sum_{1\leq n_1<n_2<\cdots<n_t}\prod_{k=1}^t\frac{q^{n_k}}{(1-q^{n_k})^2} \quad\text{ and } \sum_{\substack{1\leq n_1<n_2<\cdots<n_t\\…

The connection between the generating functions of various sets of tableaux and the appropriate families of quasisymmetric functions is a significant tool to give a direct analytical proof of some advanced bijective results and provide new…

For a possibly singular complex variety $X$, generating functions of total "orbifold Chern homology classes" of symmetric products $S^nX$ are given. Those are very natural "Chern class versions" (in the sense of Schwartz-MacPherson) of…

The signature of a path can be described as its full non-commutative exponential. Following T. Lyons we regard its expectation, the expected signature, as path space analogue of the classical moment generating function. The logarithm…

Summation formulae are classical tools in analysis: Taylor-MacLaurin, Euler-MacLaurin, Poisson, Vorono\"i, Circle formulae\ldots We will show how, from a single equation - referred to as the mother-equation - it is possible to unify these…

We use Poisson summation formula to calculate integrals of producs of sinc functions (cf. [4]) and related integrals as in [5] and [3]. We also generalize the one in [5] and introduce other remarkable integrals. Finally we give a sum…

In a general fractional factorial design, the $n$-levels of a factor are coded by the $n$-th roots of the unity. This device allows a full generalization to mixed-level designs of the theory of the polynomial indicator function which has…

We present a formula for a generalisation of the Eulerian polynomial, namely the generating polynomial of the joint distribution of major index and descent statistic over the set of signed multiset permutations. It has a description in…