Abstract
This article is part of an ongoing investigation of the combinatorics of -Catalan numbers . 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 into a disjoint union of chains indexed by partitions of size . Among other structural properties, these chains can be paired to give refinements of the famous symmetry property . Previously, we introduced a map that builds the tail part of each chain . 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 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.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.