Related papers: Combinatorial proof of a permuted basement Macdona…

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…

The quasisymmetic Macdonald polynomials $G_{\gamma}(X; q, t)$ were recently introduced by the first and second authors with Haglund, Mason, and Williams in [3] to refine the symmetric Macdonald polynomials $P_{\lambda}(X; q, t)$ with the…

We prove a motivic integral identity relating the motivic Behrend function of a $(-1)$-shifted symplectic stack to that of its stack of graded points. This generalizes analogous identities for moduli stacks of objects in…

A string theoretic derivation is given for the conjecture of Hausel, Letellier, and Rodriguez-Villegas on the cohomology of character varieties with marked points. Their formula is identified with a refined BPS expansion in the stable pair…

Recently, the numbers $Y_{n}(\lambda )$ and the polynomials $Y_{n}(x,\lambda)$ have been introduced by the second author [22]. The purpose of this paper is to construct higher-order of these numbers and polynomials with their generating…

We prove a positive combinatorial formula for the Schur expansion of LLT polynomials indexed by a 3-tuple of skew shapes. This verifies a conjecture of Haglund. The proof requires expressing a noncommutative Schur function as a positive sum…

The Haglund--Haiman--Loehr theorem provides the following combinatorial formula for the modified Macdonald polynomials: $$\tilde{H}_{\mu}(X;q,t)=\sum_{\sigma: \mu\rightarrow \mathbb{P}}x^{\sigma}t^{maj(\sigma)}q^{inv(\sigma)}.$$ Inspired by…

In a previous paper, we studied an overpartition analogue of Gaussian polynomials as the generating function for overpartitions fitting inside an $m \times n$ rectangle. Here, we add one more parameter counting the number of overlined…

We give a general multiplication-convolution identity for the multivariate and bivariate rank generating polynomial of a matroid. The bivariate rank generating polynomial is transformable to and from the Tutte polynomial by simple algebraic…

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 define a family of symmetric polynomials $G_{\nu,\lambda}(z_1,\cdots, z_{n+1},q)$ indexed by a pair of dominant integral weights. The polynomial $G_{\nu,0}(z,q)$ is the specialized Macdonald polynomial and we prove that…

Let $\mathbf{P}^{m}_{b}(x)$ be a $2m+1$-degree polynomial in $x$ and $b \in \mathbb{R}$ \[ \mathbf{P}^{m}_{b}(x) = \sum_{k=0}^{b-1} \sum_{r=0}^{m} \mathbf{A}_{m,r} k^r (x-k)^r \] where $\mathbf{A}_{m,r}$ are real coefficients. In this…

A generalization of Newton's identity on symmetric functions is given. Using the generalized Newton identity we give a unified method to show the existence of Hall-Littlewood, Jack and Macdonald polynomials. We also give a simple proof of…

For non-negative integers $k\leq n$, we prove a combinatorial identity for the $p$-binomial coefficient $\binom{n}{k}_p$ based on abelian p-groups. A purely combinatorial proof of this identity is not known. While proving this identity, for…

Fully inhomogeneous spin Hall-Littlewood symmetric rational functions $\mathsf{F}_\lambda$ arise in the context of $\mathfrak{sl}(2)$ higher spin six vertex models, and are multiparameter deformations of the classical Hall-Littlewood…

In a recent paper, Griffin, Ono and Warnaar present a framework for Rogers-Ramanujan type identities using Hall-Littlewood polynomials to arrive at expressions of the form \[\sum_{\lambda : \lambda_1 \leq m}…

Motivated by a polynomial identity of certain iterated integrals, first observed in [CGM20] in the setting of lattice paths, we prove an intriguing combinatorial identity in the shuffle algebra. It has a close connection to de Bruijn's…

We introduce Macdonald characters and use algebraic properties of Macdonald polynomials to study them. As a result, we produce several formulas for Macdonald characters, which are generalizations of those obtained by Gorin and Panova in…

In this note we develop a systematic combinatorial definition for constructed earlier supersymmetric polynomial families. These polynomial families generalize canonical Schur, Jack and Macdonald families so that the new polynomials depend…

We show that the action of classical operators associated to the Macdonald polynomials on the basis of Schur functions, S_{\lambda}[X(t-1)/(q-1)], can be reduced to addition in \lambda-rings. This provides explicit formulas for the…