A comparison of Integer partitions based on smallest part

DOI10.37236/11978arXiv2205.07931OpenAlexW4391258610MaRDI QIDQ6117417

Amarpreet Rattan, Damanvir Singh Binner

Publication date: 19 February 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.07931

zbMATH Keywords

partition inequalitiespartitions with bounded differences between largest and smallest parts

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Combinatorial inequalities (05A20) Elementary theory of partitions (11P81) Analytic theory of partitions (11P82)

Cites Work

• Simple upper bounds for partition functions
• On conjectures concerning the smallest part and missing parts of integer partitions
• Some elementary partition inequalities and their implications
• A Course in Enumeration
• Unnamed Item
• Unnamed Item

This page was built for publication: A comparison of Integer partitions based on smallest part