Related papers: Haglund's conjecture on 3-column Macdonald polynom…
Generalized Macdonald polynomials (GMP) are eigenfunctions of specifically-deformed Ruijsenaars Hamiltonians and are built as triangular polylinear combinations of Macdonald polynomials. They are orthogonal with respect to a modified scalar…
We use dual equivalence to give a short, combinatorial proof that Stanley symmetric functions are Schur positive. We introduce weak dual equivalence, and use it to give a short, combinatorial proof that Schubert polynomials are key…
We rewrite the recently proposed differential expansion formula for HOMFLY polynomials of the knot $4_1$ in arbitrary rectangular representation $R=[r^s]$ as a sum over all Young sub-diagrams $\lambda$ of $R$ with extraordinary simple…
We study the Gaussent-Littelmann formula for Hall-Littlewood polynomials and we develop combinatorial tools to describe the formula in a purely combinatorial way for type A_n, B_n and C_n. This description is in terms of Young tableaux and…
It is an important problem in algebraic combinatorics to deduce the Schur function expansion of a symmetric function whose expansion in terms of the fundamental quasisymmetric function is known. For example, formulas are known for the…
When one expands a Schur function in terms of the irreducible characters of the symplectic (or orthogonal) group, the coefficient of the trivial character is 0 unless the indexing partition has an appropriate form. A number of q-analogues…
In 1995 Stanley conjectured that the chromatic symmetric functions of the graphs $P_{d,2}$, which we call triangular ladders, were $e$-positive. In this paper we confirm this conjecture, which is also an unsolved case of the celebrated…
We give a new formula for double Grothendieck polynomials based on Magyar's orthodontia algorithm for diagrams. Our formula implies a similar formula for double Schubert polynomials $\mathfrak S_w(\mathbf x;\mathbf y)$. We also prove a…
The modified Macdonald polynomials introduced by Garsia and Haiman (1996) have many remarkable combinatorial properties. One such class of properties involves applying the $\nabla$ operator of Bergeron and Garsia (1999) to basic symmetric…
Let $G$ be an almost simple simply connected complex Lie group, and let $G/U_-$ be its base affine space. In this paper we formulate a conjecture, which provides a new geometric interpretation of the Macdonald polynomials associated to $G$…
In a recent work, Maciej Do\l{}e\k{}ga and the author have given a formula of the expansion of the Jack polynomial $J^{(\alpha)}_\lambda$ in the power-sum basis as a non-orientability generating series of bipartite maps whose edges are…
This paper proves a combinatorial rule expressing the product $s_\tau(s_{\lambda/\mu} \circ p_r)$ of a Schur function and the plethysm of a skew Schur function with a power sum symmetric function as an integral linear combination of Schur…
In 1996, Knop and Sahi introduced a remarkable family of inhomogeneous symmetric polynomials, defined via vanishing conditions, whose top homogeneous parts are exactly the Macdonald polynomials. Like the Macdonald polynomials, these…
We consider the Schur-positivity of monomial immanants of Jacobi-Trudi matrices, in particular whether a non-negative coefficient of the trivial Schur function implies non-negative coefficients for other Schur functions in said immanants.…
We introduce a triangular array $\widehat{\sf L}^{(\alpha)}$ of 5-variable homogeneous polynomials that enumerate Laguerre digraphs (digraphs in which each vertex has out-degree 0 or 1 and in-degree 0 or 1) with separate weights for peaks,…
The shuffle conjecture of Haglund et al. expresses the symmetric function $\nabla e_n$ as a sum over labeled Dyck paths. Here $\nabla$ is an operator on symmetric functions defined in terms of its diagonal action on the basis of modified…
In this article, we use Lindstr\"om Gessel Viennot Lemma to give a short, combinatorial, visualizable proof of the identity of Schur polynomials -- the sum of monomials of Young tableaux equals to the quotient of determinants. As a…
An attempt is described to extend the notion of Schur functions from Young diagrams to plane partitions. The suggestion is to use the recursion in the partition size, which is easily generalized and deformed. This opens a possibility to…
We provide a non-recursive, combinatorial classification of multiplicity-free skew Schur polynomials. These polynomials are $GL_n$, and $SL_n$, characters of the skew Schur modules. Our result extends work of H. Thomas--A. Yong, and C.…
We generalize our puzzle formula for ordinary Schubert calculus on Grassmannians, to a formula for the T-equivariant Schubert calculus. The structure constants to be calculated are polynomials in {y_{i+1} - y_i}; they were shown…