English

A Comparison of Integer Partitions Based on Smallest Part

Combinatorics 2022-05-18 v1 Number Theory

Abstract

For positive integers n,Ln, L and ss, consider the following two sets that both contain partitions of nn with the difference between the largest and smallest parts bounded by LL: the first set contains partitions with smallest part ss, while the second set contains partitions with smallest part at least s+1s+1. Let GL,s(q)G_{L,s}(q) be the generating series whose coefficient of qnq^n is difference between the sizes of the above two sets of partitions. This generating series was introduced by Berkovich and Uncu in 2019. Previous results concentrated on the nonnegativity of GL,s(q)G_{L,s}(q) in the cases s=1s=1 and s=2s=2. In the present paper, we show the eventual positivity of GL,s(q)G_{L,s}(q) for general s and also find a precise nonnegativity result for the case s=3s=3.

Keywords

Cite

@article{arxiv.2205.07931,
  title  = {A Comparison of Integer Partitions Based on Smallest Part},
  author = {Damanvir Singh Binner and Amarpreet Rattan},
  journal= {arXiv preprint arXiv:2205.07931},
  year   = {2022}
}
R2 v1 2026-06-24T11:19:06.109Z