Related papers: Rational Parking Functions and LLT Polynomials
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…
The plethystic transformation $f[X] \mapsto f[X/(1-t)]$ and LLT polynomials are central to the theory of symmetric Macdonald polynomials. In this work, we introduce and study nonsymmetric flagged LLT polynomials. We show that these admit…
Fix an integer $t \geq 2$ and a primitive $t^{\text{th}}$ root of unity $\omega$. We consider the specialized skew hook Schur polynomial $\text{hs}_{\lambda/\mu}(X,\omega X,\dots,\omega^{t-1}X/Y,\omega Y,\dots,\omega^{t-1}Y)$, where…
Pappe, Paul, and Schilling introduced two combinatorial statistics, depth and ddinv, associated with classical Dyck paths, and proved that the distributions of (area, depth) and (dinv, ddinv) are $q,t$-symmetric by constructing an…
We propose a new representation of the fourth Painlev\'e equation in which the $A^{(1)}_2$-symmetries become clearly visible. By means of this representation, we clarify the internal relation between the fourth Painlev\'e equation and the…
The classical Schur polynomials form a natural basis for the ring of symmetric polynomials, and have geometric significance since they represent the Schubert classes in the cohomology ring of Grassmannians. Moreover, these polynomials enjoy…
In a companion paper, we introduced raising operator series called Catalanimals. Among them are Schur Catalanimals, which represent Schur functions inside copies $\Lambda (X^{m,n})\subset \mathcal{E} $ of the algebra of symmetric functions…
We resolve affirmatively some conjectures of Reiner, Stanton, and White \cite{ReinerComm} regarding enumeration of transportation matrices which are invariant under certain cyclic row and column rotations. Our results are phrased in terms…
A graph is Schur-positive if its chromatic symmetric function expands nonnegatively in the Schur basis. All claw-free graphs are conjectured to be Schur-positive. We introduce a combinatorial object corresponding to a graph G, called a…
We prove some Schur positivity results for the chromatic symmetric function $X_G$ of a (hyper)graph $G$, using connections to the group algebra of the symmetric group. The first such connection works for (hyper)forests $F$: we describe the…
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…
The finite Pfaff lattice is given by commuting Lax pairs involving a finite matrix L (zero above the first subdiagonal) and a projection onto Sp(N). The lattice admits solutions such that the entries of the matrix L are rational in the time…
The Links-Quivers Correspondence predicts that the generating function for the symmetric (or antisymmetric) colored HOMFLY-PT polynomials for links can be put in a "quiver form," so that the generating function is expressed in terms of a…
We conjecture a formula for the rational $q,t$-Catalan polynomial $\mathcal{C}_{r/s}$ that is symmetric in $q$ and $t$ by definition. The conjecture posits that $\mathcal{C}_{r/s}$ can be written in terms of symmetric monomial strings…
We make a systematic study of a new combinatorial construction called a dual equivalence graph. We axiomatize these graphs and prove that their generating functions are symmetric and Schur positive. This provides a universal method for…
We give a bijective proof of a conjecture of Regev and Vershik on the equality of two multisets of hook numbers of certain skew-Young diagrams. The bijection proves a result that is stronger and more symmetric than the original conjecture,…
In recent years, Alexandersson and others proved combinatorial formulas for the Schur function expansion of the horizontal-strip LLT polynomial $G_\lambda(x;q)$ in some special cases. We associate a weighted graph $\Pi$ to $\lambda$ and we…
We enumerate interlaced pairs of parking functions whose underlying Dyck path has a bounded height. We obtain an explicit formula for this enumeration in the form of a quotient of analogs of Chebicheff polynomials having coefficients in the…
We study the Schur polynomial expansion of a family of symmetric polynomials related to the refined enumeration of alternating sign matrices with respect to their inversion number, complementary inversion number and the position of the…
The \emph{$q,t$-Catalan numbers} $C_n(q,t)$ are polynomials in $q$ and $t$ that reduce to the ordinary Catalan numbers when $q=t=1$. These polynomials have important connections to representation theory, algebraic geometry, and symmetric…