The minimal excludant and Schmidt's partition theorem

Abstract

In this work, we study Schmidt's partition theorem in a combinatorial manner, and find a strong refinement which connects the minimal excludant of ordinary partitions to the length of Schmidt's partitions. As a byproduct, we obtain a bivariate form of an identity recorded in Ramanujan's lost notebook.