Combinatorial proof of a partition inequality of Bessenrodt-Ono
From MaRDI portal
(Redirected from Publication:1684288)
Recommendations
Cites work
Cited in
(22)- An inequality and its application to Mahler's partition function
- Some inequalities for k-colored partition functions
- Polynomization of the Chern-Fu-Tang conjecture
- Proof of the Bessenrodt-Ono inequality by induction
- Variants of an partition inequality of Bessenrodt-Ono
- Polynomization of the Bessenrodt-Ono inequality
- Inequalities for plane partitions
- Multiplicative properties of the number of k-regular partitions
- Fractional partitions and conjectures of Chern-Fu-Tang and Heim-Neuhauser
- scientific article; zbMATH DE number 7069829 (Why is no real title available?)
- A Combinatorial Proof of a Partition Function Limit
- Polynomization of the Liu-Zhang inequality for the overpartition function
- A unified framework to prove multiplicative inequalities for the partition function
- Log-concavity of the restricted partition function \(p_{\mathcal{A}}(n, k)\) and the new Bessenrodt-Ono type inequality
- On a bipartition problem of Bollobás and Scott
- A combinatorial proof of a partition perimeter inequality
- Polynomization of the Bessenrodt-Ono type inequalities for \(A\)-partition functions
- Inequalities for k-regular partitions
- On a general approach to Bessenrodt-Ono type inequalities and log-concavity properties
- On the Bessenrodt-Ono type inequality for a wide class of a-partition functions
- Inequalities for the k-regular overpartition function
- Polynomization of Sun's conjecture
This page was built for publication: Combinatorial proof of a partition inequality of Bessenrodt-Ono
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1684288)