English
Related papers

Related papers: Decorated square paths at q=-1

200 papers

We provide a combinatorial interpretation of the symmetric function $\left.\Theta_{e_k}\Theta_{e_l}\nabla e_{n-k-l}\right|_{t=0}$ in terms of segmented Smirnov words. The motivation for this work is the study of a diagonal coinvariant ring…

Combinatorics · Mathematics 2024-01-12 Alessandro Iraci , Philippe Nadeau , Anna Vanden Wyngaerd

Let $\lambda =\left( \lambda_{1},\lambda_{2},...,\lambda_{r}\right) $ be an integer partition, and $\left[p_{\lambda }\right] $ the $q$-analog of the symmetric power function $%p_{\lambda }$. This $q$-analogue has been defined as a special…

Combinatorics · Mathematics 2024-09-16 Vincent Brugidou

We conjecture two combinatorial interpretations for the symmetric function $\Delta_{e_k} e_n$, where $\Delta_f$ is an eigenoperator for the modified Macdonald polynomials defined by Bergeron, Garsia, Haiman, and Tesler. Both interpretations…

Combinatorics · Mathematics 2017-09-07 James Haglund , Jeffrey Remmel , Andrew Timothy Wilson

In a 2016 ArXiv posting F. Bergeron listed a variety of symmetric functions $G[X;q]$ with the property that $G[X;1+q]$ is $e$-positive. A large subvariety of his examples could be explained by the conjecture that the Dyck path LLT…

Combinatorics · Mathematics 2019-04-18 Adriano M. Garsia , James Haglund , Dun Qiu , Marino Romero

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…

Combinatorics · Mathematics 2025-09-30 Jonah Blasiak , Mark Haiman , Jennifer Morse , Anna Pun , George H. Seelinger

We study Schroder paths drawn in a (m,n) rectangle, for any positive integers m and n. We get explicit enumeration formulas, closely linked to those for the corresponding (m,n)-Dyck paths. Moreover we study a Schroder version of…

Combinatorics · Mathematics 2016-04-01 Jean-Christophe Aval , Francois Bergeron

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…

Combinatorics · Mathematics 2007-06-01 Nicholas A. Loehr , Gregory S. Warrington

We show that the q-Narayana numbers for q=-1 count symmetric Dyck paths according to the number of their valleys.

Combinatorics · Mathematics 2026-01-14 Johann Cigler

In a recent paper J. Haglund showed that a certain symmetric function expresion enumerates by t^{area} q^{dinv} of the parking functions whose diagonal word is in the shuffle of 12...j and j+1...j+n with k of the cars j+1,...,j+n in the…

Combinatorics · Mathematics 2012-05-29 Adrian Duane , Adriano M. Garsia , Mike Zabrocki

We prove Stanley's conjecture that, if delta_n is the staircase shape, then the skew Schur functions s_{delta_n / mu} are non-negative sums of Schur P-functions. We prove that the coefficients in this sum count certain fillings of shifted…

Combinatorics · Mathematics 2011-08-11 Federico Ardila , Luis G. Serrano

It is shown that a refined version of a q-analogue of the Eulerian numbers together with the action, by conjugation, of the subgroup of the symmetric group $S_n$ generated by the $n$-cycle $(1,2,...,n)$ on the set of permutations of fixed…

Combinatorics · Mathematics 2009-09-18 Bruce Sagan , John Shareshian , Michelle L. Wachs

We prove the Schr\"oder case, i.e. the case $\langle \cdot,e_{n-d}h_d \rangle$, of the conjecture of Haglund, Remmel and Wilson (Haglund et al. 2018) for $\Delta_{h_m}\Delta_{e_{n-k-1}}'e_n$ in terms of decorated partially labelled Dyck…

Combinatorics · Mathematics 2022-06-06 Michele D'Adderio , Alessandro Iraci , Anna Vanden Wyngaerd

We introduce the family of Theta operators $\Theta_f$ indexed by symmetric functions $f$ that allow us to conjecture a compositional refinement of the Delta conjecture of Haglund, Remmel and Wilson for $\Delta_{e_{n-k-1}}'e_n$. We show that…

Combinatorics · Mathematics 2022-06-06 Michele D'Adderio , Alessandro Iraci , Anna Vanden Wyngaerd

Our main result here is that the specialization at $t=1/q$ of the $Q_{km,kn}$ operators studied in [4] may be given a very simple plethystic form. This discovery yields elementary and direct derivations of several identities relating these…

Combinatorics · Mathematics 2015-01-06 A. M. Garsia , E. Leven , N. Wallach , G. Xin

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…

Combinatorics · Mathematics 2016-03-15 Eugene Gorsky , Mikhail Mazin

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…

Combinatorics · Mathematics 2026-05-12 Menghao Qu , Yingrui Zhang

Let $D$ be a digraph and let $\lambda(D)$ denote the number of vertices in a longest path of $D$. For a pair of vertex-disjoint induced subdigraphs $A$ and $B$ of $D$, we say that $(A,B)$ is a partition of $D$ if $V(A)\cup V(B)=V(D).$ The…

Combinatorics · Mathematics 2021-11-19 Jiangdong Ai , Stefanie Gerke , Gregory Gutin , Yacong Zhou

The original Shuffle Conjecture of Haglund et al. has a symmetric function side and a combinatorial side. The symmetric function side may be simply expressed as $<\nabla e_n, h_{\mu}>$ where \nabla is the Macdonald polynomial eigen-operator…

Combinatorics · Mathematics 2013-04-29 Angela Hicks , Emily Leven

We develop a calculus based on graph enumeration for $S_n$-equivariant motivic invariants of graphically stratified moduli spaces. We apply our theory to the Deligne--Mumford moduli space $\overline{\mathcal{M}}_{g, n}$ and to the space of…

Algebraic Geometry · Mathematics 2025-10-09 Siddarth Kannan , Terry Dekun Song

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…

Combinatorics · Mathematics 2019-11-01 Kyungyong Lee , Li Li , Nicholas A. Loehr