Search arXivSearch

arXiv · 1711.03923

Parallelogram polyominoes, partially labelled Dyck paths, and the Delta conjecture

Abstract

We introduce area, bounce and dinv statistics on decorated parallelogram polyominoes, and prove that some of their q,t-enumerators match $\langle Δ_{h_m} e_{n+1}, s_{k+1,1^{n-k}} \rangle$, extending in this way the work in (Aval et al. 2014). Also, we provide a bijective connection between decorated parallelogram polyominoes and decorated labelled Dyck paths, which allows us to prove the combinatorial interpretation of the coefficient $\langleΔ_{e_{m+n-k-1}}'e_{m+n}, h_m h_n \rangle$ predicted by the Delta conjecture in (Haglund et al. 2015). Finally, we define a statistic pmaj on partially labelled Dyck paths, which provides another conjectural combinatorial interpretation of $Δ_{h_{\ell}}Δ_{e_{n-k-1}}'e_n$, cf. (Haglund et al. 2015). This is an extended abstract of (D'Adderio, Iraci 2017): this forthcoming publication will have proofs and additional details and results.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michele D'Adderio, Alessandro Iraci. 2017-11-10. Parallelogram polyominoes, partially labelled Dyck paths, and the Delta conjecture. https://arxiv.org/abs/1711.03923

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO