On Conjectures Concerning the Smallest Part and Missing Parts of Integer Partitions

For positive integers $s$ and $L \geq 3$, 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.