Related papers: Decorated square paths at q=-1
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…
In this paper, we formulate a rational analog of the fall Delta theorem and the Delta square conjecture. We find a new dinv statistic on fall-decorated paths on a $(m+k) \times (n+k)$ rectangle that simultaneously extends the previously…
We introduce area, bounce and dinv statistics on decorated parallelogram polyominoes, and prove that some of their q,t-enumerators match $\langle \Delta_{h_m} e_{n+1},s_{k+1,1^{n-k}}\rangle$, extending in this way the work in (Aval et al.…
We introduce area, bounce and dinv statistics on decorated parallelogram polyominoes, and prove that some of their q,t-enumerators match $\langle \Delta_{h_m} e_{n+1}, s_{k+1,1^{n-k}} \rangle$, extending in this way the work in (Aval et al.…
We discuss the combinatorics of the decorated Dyck paths appearing in the Delta conjecture framework of Haglund, Remmel and Wilson (2015) and Zabrocki (2016), by introducing two new statistics, bounce and bounce'. We then provide plethystic…
In the context of the shuffle theorem, many classical integer sequences appear with a natural refinement by two statistics $q$ and $t$: for example the Catalan and Schr\"oder numbers. In particular, the bigraded Hilbert series of diagonal…
In (Haglund, Remmel, Wilson 2018) Haglund, Remmel and Wilson introduced their Delta conjectures, which give two different combinatorial interpretations of the symmetric function $\Delta'_{e_{n-k-1}} e_n$ in terms of rise-decorated or…
We discuss the combinatorics of decorated Dyck paths and decorated parallelogram polyominoes, extending to the decorated case the main results of both [Haglund 2004] and [Aval et al. 2014]. This settles in particular the cases…
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…
We use a weight-preserving, sign-reversing involution to find a combinatorial expansion of $\Delta_{e_k} e_n$ at $q=1$ in terms of the elementary symmetric function basis. We then use a weight-preserving bijection to prove the Delta…
We enumerate height-restricted path diagrams associated with $q$-tangent and $q$-secant numbers by considering convergents of continued fractions, leading to expressions involving basic hypergeometric functions. Our work generalises some…
In 10.1093/imrn/rnac258, the authors conjecture a combinatorial formula for the expressions $\Xi e_\alpha \rvert_{t=1}$, known as Symmetric Theta Trees Conjecture, in terms of tiered trees with an inversion statistic. In…
For a graph $G$ on $[n]$, the $k$-cut complex $\Delta_k(G)$ has facets $[n]\setminus T$, where $T$ ranges over the disconnected $k$-vertex induced subgraphs of $G$. Bayer, Denker, Jeli\'c Milutinovi\'c, Sundaram, and Xue proved that the…
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…
For any Schur function $s_{\nu}$, the associated {\em delta operator} $\Delta'_{s_{\nu}}$ is a linear operator on the ring of symmetric functions which has the modified Macdonald polynomials as an eigenbasis. When $\nu = (1^{n-1})$ is a…
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…
In this paper, we extend the rectangular side of the shuffle conjecture by stating a rectangular analogue of the square paths conjecture. In addition, we describe a set of combinatorial objects and one statistic that are a first step…
Let the symmetric functions be defined for the pair of integers $\left( n,r\right) $, $n\geq r\geq 1$, by $p_{n}^{\left( r\right) }=\sum m_{\lambda }$ where $m_{\lambda }$ are the monomial symmetric functions, the sum being over the…
Let $m_{\lambda }$ be the monomial symmetric functions, $ \lambda $ being an integer partition of $n\in \mathbb{N}^{\ast }$. For the specialization corresponding to the $q$-deformation of the exponential, we prove that each $m_{\lambda }$…
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…