Search arXivSearch

arXiv · 2608.08518

Some new results for Andrews' Kimberling partitions

Abstract

George E. Andrews (2016) introduced the Kimberling index, $K(π)$, of a partition $π$ of a positive integer $n$, which is defined as $$K(π) = (\text{largest part of } π) - (\text{least part of } π) - (\text{number of parts of } π).$$ Based on Kimberling index, Andrews defined five partition functions, $K_>(n),$ $K_<(n),$ $K_\leq(n),$ $K_=(n),$ and $K_\geq(n)$, called Kimberling partition functions, which count the numbers of partitions of a positive integer $n$ for which the Kimberling index $K(π) $ is $>0$, $<0$, $\leq0$, $=0$ and $\geq 0$, respectively. He also gave the generating functions for $K_\le(n),$ $K_<(n),$ and $K_>(n)$ and established some relations connecting Kimberling partitions and other partition functions. Since then, the Kimberling partition functions and their generating functions remained unexplored. In this paper, we derive generating functions for $K_=(n),$ and $K_\geq(n)$, and establish some congruence relations of the five Kimberling partition functions by using the method of $q$-series identities.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gaurab Bardhan, Nipen Saikia. 2026-08-09. Some new results for Andrews' Kimberling partitions. https://arxiv.org/abs/2608.08518

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