Combinatorial proofs for partitions with repeated smallest part

Abstract

Recently, Andrews and El Bachraoui considered the number of integer partitions whose smallest part is repeated exactly $k$ times and the remaining parts are not repeated. They presented several interesting results and posed questions regarding combinatorial proofs for these identities. In this paper, we establish bijections to provide combinatorial proofs for these results.