On the generating functions for partitions with repeated smallest part

George E. Andrews, Mohamed El Bachraoui

Research output: Contribution to journalArticlepeer-review

Abstract

We consider the number of integer partitions whose smallest part is repeated exactly k times and the remaining parts are not repeated. We prove that their generating functions are linear combinations of the q-Pochhammer symbols with polynomials as coefficients. Focusing on the cases k=1,2, and 3, we derive new identities and inequalities for the partitions into distinct parts.

Original languageEnglish
Article number129537
JournalJournal of Mathematical Analysis and Applications
Volume549
Issue number1
DOIs
Publication statusPublished - Sept 1 2025

Keywords

  • Integer partitions
  • q-series

ASJC Scopus subject areas

  • Analysis
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'On the generating functions for partitions with repeated smallest part'. Together they form a unique fingerprint.

Cite this