Related papers: Five-Term Relations for wreath Macdonald polynomia…
A generalization of the Macdonald polynomials depending upon both commuting and anticommuting variables has been introduced recently. The construction relies on certain orthogonality and triangularity relations. Although many…
5-brane configurations describing 5d field theories are promoted to an M theory description a la Witten in terms of polynomials in two complex variables. The coefficients of the polynomials are the Coulomb branch. This picture resolves…
In this paper, we derive new combinatorial formulas for symmetric Macdonald polynomials $P_{\lambda}(X;q,t)$ and integral Macdonald polynomials $J_{\lambda}(X;q,t)$, in terms of several new statistics and the major index for a partition…
We introduce a new family of symmetric multivariate polynomials, whose coefficients are meromorphic functions of two parameters $(q,t)$ and polynomial in a further two parameters $(u,v)$. We evaluate these polynomials explicitly as a matrix…
We present a probabilistic generalization of the Robinson--Schensted correspondence in which a permutation maps to several different pairs of standard Young tableaux with nonzero probability. The probabilities depend on two parameters $q$…
We derive an explicit sum formula for symmetric Macdonald polynomials. Our expression contains multiple sums over the symmetric group and uses the action of Hecke generators on the ring of polynomials. In the special cases $t=1$ and $q=0$,…
We interpret the five parameter family of Macdonald-Koornwinder polynomials as vector valued spherical functions on quantum Grassmannians.
We discuss the problem of factorisation of the symmetric Macdonald polynomials and present the obtained results for the cases of 2 and 3 variables.
We use $q$-binomial theorem to prove three new polynomial identities involving $q$-trinomial coefficients. We then use summation formulas for the $q$-trinomial coefficients to convert our identities into another set of three polynomial…
We formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The…
We introduce generalization of famous Macdonald polynomials for the case of super-Young diagrams that contain half-boxes on the equal footing with full boxes. These super-Macdonald polynomials are polynomials of extended set of variables:…
For a composition $f=f_1\circ\cdots \circ f_r$ of polynomials $f_i\in \mathbb Q[x]$ of degrees $d_i\geq 5$ with alternating or symmetric monodromy group, we show that the monodromy group of $f$ contains the iterated wreath product…
Exploiting the fact that the $q$-Whittaker polynomials arise as a specialization of the (modified) Macdonald polynomials, we derive some of their basic properties, and explore interesting identities that they satisfy. We also show how they…
The Macdonald polynomials with prescribed symmetry are obtained from the nonsymmetric Macdonald polynomials via the operations of $t$-symmetrisation, $t$-antisymmetrisation and normalisation. Motivated by corresponding results in Jack…
To every partial order P, one associates a polynomial $\mathbb{D}_P$ in 4 variables that enumerates the intervals of P according to 4 parameters. Some symmetry properties of this polynomial are obtained for a specific family of posets, the…
We consider 3-parametric polynomials which replace the A-series interpolation Macdonald polynomials in the BC case. For these polynomials, we prove: an integral representation, a combinatorial formula, Pieri-type rules, Cauchy identity, and…
We present a probabilistic generalization of the Robinson--Schensted correspondence in which a permutation maps to several different pairs of standard Young tableaux with nonzero probability. The probabilities depend on two parameters $q$…
It is shown that monic orthogonal polynomials on the unit circle are the characteristic polynomials of certain five-diagonal matrices depending on the Schur parameters. This result is achieved through the study of orthogonal Laurent…
We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify polynomial runtime complexity of term rewrite systems and the polytime computability of the…
The super Macdonald polynomials indexed by the super partitions form a basis of the level zero super Fock module (combinatorial representation) of the quantum toroidal algebra $\mathcal{U}_{q,t}(\widehat{\widehat{\mathfrak{gl}}}_{1|1})$.…