Two partition inequalities related to the minimal excludant (Q6139317)

In this article, the authors prove \(l(n,m)=e(n,m)\) analytically and combinatorially; and \(s_{e}(n)>s_{o}(n)\) combinatorially. Further, they establish relations for all \(n>0\), \(l_{e}(2n)=p_{2,1}(2n)\), \(l_{e}(2n+1)=\overline{p}_{2,1}(2n+1)\); \(l_{o}(2n)=\overline{p}_{2,1}(2n)\), \(l_{o}(2n+1)=p_{2,1}(2n+1)\) and \(l_{e}(n)=p_{4,2}(n)\), \(l_{o}(n)=\overline{p}_{4,2}(n)\).