Search arXivSearch

arXiv · 2505.09821

$q$-Super Catalan Numbers: Combinatorial identities, Generating Functions, and Narayana Refinements

Abstract

We begin by deriving a number of combinatorial identities satisfied by the $q$-super Catalan numbers. In particular, we extend some of the known combinatorial identities (Touchard, Koshy, Reed Dawson) to the $q$-super Catalan numbers. Next, we introduce some $q$-convolution identities involving q-central binomial and q-Catalan numbers and derive a generating function for $q$-Catalan numbers. Then we introduce Narayana-type refinements of the super Catalan numbers. We prove algebraically the $γ$-positivity of those refinements and give a combinatorial proof in a special case through the type B analog of noncrossing partitions. Then we introduce their natural $q$-analogs, prove their $q$-$γ$-positivity and prove some identities they satisfy, generalizing identities of Kreweras and Le Jen-Shoo. Using yet another identity, we prove that these refinements are positive integer polynomials in $q$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Arthur Rodelet--Causse, Lenny Tevlin. 2025-05-14. $q$-Super Catalan Numbers: Combinatorial identities, Generating Functions, and Narayana Refinements. https://doi.org/10.1016/j.aam.2025.102911

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