Chain decompositions of q,t-Catalan numbers: tail extensions and flagpole partitions

preprint2022arXivOpen access

Abstract

This article is part of an ongoing investigation of the combinatorics of q,tq,t-Catalan numbers Catn(q,t)\textrm{Cat}_n(q,t). We develop a structure theory for integer partitions based on the partition statistics dinv, deficit, and minimum triangle height. Our goal is to decompose the infinite set of partitions of deficit kk into a disjoint union of chains Cμ\mathcal{C}_μ indexed by partitions of size kk. Among other structural properties, these chains can be paired to give refinements of the famous symmetry property Catn(q,t)=Catn(t,q)\textrm{Cat}_n(q,t)=\textrm{Cat}_n(t,q). Previously, we introduced a map that builds the tail part of each chain Cμ\mathcal{C}_μ. Our first main contribution here is to extend this map to construct larger second-order tails for each chain. Second, we introduce new classes of partitions called flagpole partitions and generalized flagpole partitions. Third, we describe a recursive construction for building the chain Cμ\mathcal{C}_μ for a (generalized) flagpole partition μμ, assuming that the chains indexed by certain specific smaller partitions (depending on μμ) are already known. We also give some enumerative and asymptotic results for flagpole partitions and their generalized versions.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.