Search arXivSearch

arXiv · 2509.24942

Sequences of odd length in strict partitions IV: the combinatorics of parameterized Rogers-Ramanujan type identities

Abstract

In the first three papers, we conducted a series of discussions on the statistics of strict partitions and Rogers-Ramanujan partitions, specifically the sequences of odd length (denoted as $\mathrm{sol}$) and its extensions. We established bijections for some Rogers-Ramanujan type identities. This paper will continue that series of work, and first we will use the bijective method to re-establish several parameterized Rogers-Ramanujan type identities, which appeared in the recent work of Hao-Kuai-Xia and Li-Wang. Moreover, we focus on the work of Chen-Yin and parameterize their main results, where the $\mathrm{sol}$ has evolved.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Haijun Li. 2025-09-29. Sequences of odd length in strict partitions IV: the combinatorics of parameterized Rogers-Ramanujan type identities. https://arxiv.org/abs/2509.24942

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