Symmetry of the refined q,t-Catalan polynomials for k-Dyck paths

Abstract

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 involution on plane trees. They also provided a new formula for the original q,t-Catalan polynomials Cn(q,t). We observe that depth is a slight modification of bounce, which was defined by the filling algorithm and ranking algorithm of Xin and the second author in their study of k-Dyck paths. In this article, we generalize depth of classical Dyck paths to the case of k-Dyck paths and prove q,t-symmetry of the pair of statistics (area, depth) for K-Dyck paths. We provide an alternative description of the higher q,t-Catalan polynomials Cn(k)(q,t).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…