Full bibliography

The Alder–Andrews Theorem, a partition inequality generalizing Euler’s partition identity, the first Rogers–Ramanujan identity, and a theorem of Schur to d-distinct partitions of n, was proved successively by Andrews in 1971, Yee in 2008, and Alfes, Jameson, and Lemke Oliver in 2010. While Andrews and Yee utilized q-series and combinatorial methods, Alfes et al. proved the finite number of remaining cases using asymptotics originating with Meinardus together with high-performance computing. In 2020, Kang and Park conjectured a “level 2” Alder–Andrews type partition inequality which relates to the second Rogers–Ramanujan identity. Duncan, Khunger, the second author, and Tamura proved Kang and Park’s conjecture for all but finitely many cases using a combinatorial shift identity. Here, we generalize the methods of Alfes et al. to resolve nearly all of the remaining cases of Kang and Park’s conjecture. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2026.