相关论文: Dens, nests and the Loehr-Warrington conjecture

We identify certain combinatorially defined rational functions which, under the shuffle to Schiffmann algebra isomorphism, map to LLT polynomials in any of the distinguished copies $\Lambda (X^{m,n})\subset \mathcal{E}$ of the algebra of…

We conjecture a formula for the symmetric function $\frac{[n-k]_t}{[n]_t}\Delta_{h_m}\Delta_{e_{n-k}}\omega(p_n)$ in terms of decorated partially labelled square paths. This can be seen as a generalization of the square conjecture of Loehr…

We generalize the shuffle theorem and its $(km,kn)$ version, as conjectured by Haglund et al. and Bergeron et al., and proven by Carlsson and Mellit, and Mellit, respectively. In our version the $(km,kn)$ Dyck paths on the combinatorial…

We study the class $\mathcal C$ of symmetric functions whose coefficients in the Schur basis can be described by generating functions for sets of tableaux with fixed shape. Included in this class are the Hall-Littlewood polynomials,…

Gorsky and Negut introduced operators $Q_{m,n}$ on symmetric functions and conjectured that, in the case where $m$ and $n$ are relatively prime, the expression ${Q}_{m,n}(1)$ is given by the Hikita polynomial ${H}_{m,n}[X;q,t]$. Later,…

Egge, Loehr and Warrington gave in \cite{ELW} a combinatorial formula that permits to convert the expansion of a symmetric function, homogeneous of degree $n$, in terms of Gessel's fundamental quasisymmetric functions into an expansion in…

We conjecture a combinatorial formula for the monomial expansion of the image of any Schur function under the Bergeron-Garsia nabla operator. The formula involves nested labeled Dyck paths weighted by area and a suitable "diagonal…

We prove that the combinatorial side of the "Rational Shuffle Conjecture" provides a Schur-positive symmetric polynomial. Furthermore, we prove that the contribution of a given rational Dyck path can be computed as a certain skew LLT…

We define a number of related combinatorial objects, each of which possesses a surprising symmetry. We include several applications such as a combinatorial explanation for certain fixed points of the involution $\omega$ on the ring of…

We study a multi-symmetric generalization of the classical Schur functions called the multi-symmetric Schur functions. These functions form an integral basis for the ring of multi-symmetric functions indexed by tuples of partitions and are…

In \cite{HRW15}, Haglund, Remmel, Wilson state a conjecture which predicts a purely combinatorial way of obtaining the symmetric function $\Delta_{e_k}e_n$. It is called the Delta Conjecture. It was recently proved in \cite{GHRY} that the…

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…

We introduce the new combinatorial approach of plethystic type of tableaux, as a method to understand coefficients of Schur functions appearing in plethysms $s_\nu[h_\lambda]$ and $s_{\nu}[e_{\lambda}]$, for any partitions $\lambda$ and…

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…

We prove that the symmetric function $\Delta'_{e_{k-1}}e_n$ appearing in the Delta Conjecture can be obtained from the symmetric function in the Rational Shuffle Theorem by applying a Schur skewing operator. This generalizes a formula by…

We construct a new class of operators that act on symmetric functions with two deformation parameters $q$ and $t$. Our combinatorial construction associates each operator with a specific lattice path, whose steps alternate between moving up…

This paper develops three related combinatorial results for Dyck-type sequences. First, it constructs a row-insertion algorithm for dual Dyck sequences and extends it to Dyck tableaux. This construction gives a weight-preserving bijection…

We give a combinatorial expansion of the stable Grothendieck polynomials of skew Young diagrams in terms of skew Schur functions, using a new row insertion algorithm for set-valued semistandard tableaux of skew shape. This expansion unifies…

The identities which are in the literature often called ``bounded Littlewood identities" are determinantal formulas for the sum of Schur functions indexed by partitions with bounded height. They have interesting combinatorial consequences…

Our results can be viewed as applications of algebraic combinatorics in random matrix theory. These applications are motivated by the predictive power of random matrix theory for the statistical behavior of the celebrated Riemann…