Decorated square paths at q=-1

Abstract

The valley Delta square conjecture states that the symmetric function $\frac{[n-k]_q}{[n]_q}Δ_{e_{n-k}}ω(p_n)$ can be expressed as the enumerator of a certain class of decorated square paths with respect to the bistatistic (dinv,area). Inspired by recent positivity results of Corteel, Josuat-Vergès, and Vanden Wyngaerd, we study the evaluation of this enumerator at $q=-1$. By considering a cyclic group action on the decorated square paths which we call cutting and pasting, we show that $\left.\left\langle \frac{[n-k]_q}{[n]_q}Δ_{e_{n-k}}ω(p_n), h_1^n\right\rangle\right|_{q=-1}$ is $0$ whenever $n-k$ is even, and is a positive polynomial related to the Euler numbers when $n-k$ is odd. We also show that the combinatorics of this enumerator is closely connected to that of the Dyck path enumerator for $\langleΔ_{e_{n-k-1}}'e_n,h_1^n\rangle$ considered by Corteel-Josuat Vergès-Vanden Wyngaerd.