Some new results for Andrews' Kimberling partitions
Gaurab Bardhan, Nipen Saikia
Abstract
George E. Andrews (2016) introduced the Kimberling index, K(π), of a partition π of a positive integer n, which is defined as K(π) = (largest part of π) - (least part of π) - (number of parts of π). Based on Kimberling index, Andrews defined five partition functions, K>(n), K<(n), K≤(n), K=(n), and K≥(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, ≤0, =0 and ≥ 0, respectively. He also gave the generating functions for K(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≥(n), and establish some congruence relations of the five Kimberling partition functions by using the method of q-series identities.
Create a lesson
Related papers
Simple Cayley permutations
Giulio Cerbai, Anders Claesson
Transfer of difference structures: a new semidirect product framework
Sophie Huczynska, Struan McCartney, Carys Williams
Connected Mutual-Visibility in Graphs
Tonny K B, Shikhi M
Decomposing Gorenstein polytopes of large index
Johannes Knupfer, Benjamin Nill
A non-trivial bound for 3AP-intersecting families
Peter Keevash
Solution to a conjecture on integral uniform hypercycles
Joyentanuj Das, Iswar Mahato