Related papers: Signed Mahonians

Sequences are often conveniently encoded in the form of a generating function depending on a formal variable. This note presents two observations that allow one to draw conclusions about the generated sequence from the generating function.…

We establish recurrences formulas of the order of the classical groups that allow us to find a generalization of Euler's angles for classical groups and the invariant measures of these groups. We find the generating function for the SU(2)…

We establish a simple recurrence formula for the number $Q_g^n$ of rooted orientable maps counted by edges and genus. We also give a weighted variant for the generating polynomial $Q_g^n(x)$ where $x$ is a parameter taking the number of…

We consider the summatory function of the number of prime factors for integers $\leq x$ over arithmetic progressions. Numerical experiments suggest that some arithmetic progressions consist more number of prime factors than others. Greg…

We give an exact coefficients formula of any infinite product of power series with constant term equal to $1$, by using structures from partitions of integers and permutation groups. This is an universal theorem for various of Binomial-type…

Let S=Sym(\Omega) be the group of all permutations of an infinite set \Omega. Extending an argument of Macpherson and Neumann, it is shown that if U is a generating set for S as a group, respectively as a monoid, then there exists a…

We give a simple proof of a major index determinant formula in the symmetric group discovered by Krattenthaler and first proved by Thibon using noncommutative symmetric functions. We do so by proving a factorization of an element in the…

Sketch of proof of a theorem relating the two subjects of the title. It can be thought as an extension of results of Landau for the classical hypergeometric function. It relies on the characterization of algebraic hypergeometric functions…

It is demonstrated how an explicit expression of the (partial) sum of Tetranacci numbers can be found and proved using generating functions and the Hadamard product. We also provide a Binet-type formula for generalized Fibonacci numbers, by…

In [8] a notion of generalized Hadamard product was introduced. We show that when certain kinds of tensors interact with the eigenvalues of symmetric matrices the resulting formulae can be nicely expressed using the generalized Hadamard…

We propose a unified approach to prove general formulas for the joint distribution of an Eulerian and a Mahonian statistic over a set of colored permutations by specializing Poirier's colored quasisymmetric functions. We apply this method…

We give a short proof of the inner product conjecture for the symmetric Macdonald polynomials of type $A_{n-1}$. As a special case, the corresponding constant term conjecture is also proved.

We considered the properties of generalized Fibonacci and Lucas numbers class. The analogues of well-known Fibonacci identities for generalized numbers are obtained. We gained a new identity of product convolution of generalized Fibonacci…

Analogues of classical combinatorial identities for elementary and homogeneous symmetric functions with coefficients in Yanigian are discussed. As a corollary, similar relations are deduced for shifted Schur functions.

We define and study odd and even analogues of the major index statistics for the classical Weyl groups. More precisely, we show that the generating functions of these statistics, twisted by the one-dimensional characters of the…

The Macdonald operator is known to coincide with a certain element of the quantum toroidal $\mathfrak{gl}(1)$ algebra in the Fock representation of levels $(1,0)$. A generalization of this operator to higher levels $(r,0)$ can be built…

We discuss the folklore construction of the Gray tensor product of 2-categories as obtained by factoring the map from the funny tensor product to the cartesian product. We show that this factorisation can be obtained without using a…

In this research announcement we present a new q-analog of a classical formula for the exponential generating function of the Eulerian polynomials. The Eulerian polynomials enumerate permutations according to their number of descents or…

We present a short proof of MacMahon's classic result that the number of permutations with $k$ inversions equals the number whose major index (sum of positions at which descents occur) is $k$

We consider products of two Macdonald polynomials of type A, indexed by dominant weights which are respectively a multiple of the first fundamental weight and a weight having zero component on the k-th fundamental weight. We give the…