Extending Andrews and Newman’s refinement of the Crank–Mex theorem

The Crank–Mex theorem states that the number of integer partitions of n with nonnegative crank equals the number with odd minimal excludant (mex). Andrews and M. Newman recently refined that result in terms of the number of parts greater than 1. Here, we establish and expand a complementary result connecting the partitions with even mex, having fixed points, with negative crank, and with positive crank, all refined in terms of number of parts greater than 1. We provide both analytic and combinatorial proofs.