On conjectures concerning the smallest part and missing parts of integer partitions

DOI10.1007/S00026-021-00528-5MaRDI QIDQ1981004zbMATH OpenOpenAlexWikidataFDO

Authors Damanvir Singh Binner, Amarpreet Rattan

Publication date 9 September 2021

Published in Annals of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

partition inequalities

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)

Abstract: For positive integers $s$ and $Lgeq3$, Berkovich and Uncu (Ann. Comb. $23$ ($2019$) $263$--$284$) conjectured an inequality between the sizes of two closely related sets of partitions whose parts lie in the interval $s,ldots,L+s$. Further restrictions are placed on the sets by specifying impermissible parts as well as a minimum part. The authors proved their conjecture for the cases $s=1$ and $s=2$. In the present article, we prove the conjecture for general $s$ by proving a stronger theorem. We also prove other related conjectures found in the same paper.

Recommendations

• On partitions classified by smallest missing part
• Some elementary partition inequalities and their implications
• On a conjecture of Andrews
• On a conjecture of Andrews
• On the largest size of a partition that is both s-core and t-core

Cites work

• scientific article; zbMATH DE number 2229032 (Why is no real title available?)
• New weighted partition theorems with the emphasis on the smallest part of partitions
• Partitions with bounded differences between largest and smallest parts
• Partitions with fixed differences between largest and smallest parts
• Some elementary partition inequalities and their implications
• The number of solutions to \(ax + by + cz = n\) and its relation to quadratic residues

Cited in

(5)

• Some elementary partition inequalities and their implications
• On partitions classified by smallest missing part
• Berkovich-Uncu type partition inequalities concerning impermissible sets and perfect power frequencies
• A comparison of Integer partitions based on smallest part
• Gaps between the largest and smallest parts of partitions and conjectures of Berkovich and Uncu

This page was built for publication: On conjectures concerning the smallest part and missing parts of integer partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1981004)