Combinatorial proof of a partition inequality of Bessenrodt-Ono
From MaRDI portal
Publication:1684288
DOI10.1007/s00026-017-0358-9zbMath1375.05014OpenAlexW2736845612MaRDI QIDQ1684288
Augustine O. Munagi, Abdulaziz A. Alanazi, Stephen M. III Gagola
Publication date: 8 December 2017
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00026-017-0358-9
Related Items (9)
Some inequalities for \(k\)-colored partition functions ⋮ Polynomization of the Bessenrodt-Ono inequality ⋮ Polynomization of the Liu-Zhang inequality for the overpartition function ⋮ Log-concavity of the restricted partition function \(p_{\mathcal{A}}(n, k)\) and the new Bessenrodt-Ono type inequality ⋮ Inequalities for plane partitions ⋮ Polynomization of the Chern-Fu-Tang conjecture ⋮ Proof of the Bessenrodt-Ono inequality by induction ⋮ Variants of an partition inequality of Bessenrodt-Ono ⋮ Fractional partitions and conjectures of Chern–Fu–Tang and Heim–Neuhauser
Cites Work
This page was built for publication: Combinatorial proof of a partition inequality of Bessenrodt-Ono