Proof of the Bessenrodt-Ono inequality by induction
From MaRDI portal
Publication:2065747
DOI10.1007/s40993-021-00301-wzbMath1480.05008arXiv2108.00191OpenAlexW3217499793WikidataQ114218082 ScholiaQ114218082MaRDI QIDQ2065747
Bernhard E. Heim, Markus Neuhauser
Publication date: 13 January 2022
Published in: Research in Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.00191
Combinatorial aspects of partitions of integers (05A17) Combinatorial inequalities (05A20) Analytic theory of partitions (11P82)
Related Items (3)
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
Cites Work
- Unnamed Item
- Unnamed Item
- Maximal multiplicative properties of partitions
- Multiplicative properties of the number of \(k\)-regular partitions
- Log-concavity of the partition function
- Asymptotic equidistribution and convexity for partition ranks
- The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications
- Sur les entiers n pour lesquels il y à beaucoup de groupes abéliens d'ordre \(n\)
- Some inequalities for \(k\)-colored partition functions
- Combinatorial proof of a partition inequality of Bessenrodt-Ono
- Dyson's partition ranks and their multiplicative extensions
- Polynomization of the Chern-Fu-Tang conjecture
- Exact formulae for the fractional partition functions
- The Dedekind eta function and D'Arcais-type polynomials
- Effective bounds for the Andrews spt-function
- Polynomization of the Bessenrodt-Ono inequality
- Higher order Turán inequalities for the partition function
- Fractional partitions and conjectures of Chern–Fu–Tang and Heim–Neuhauser
- Jensen polynomials for the Riemann zeta function and other sequences
- Recurrence relations for polynomials obtained by arithmetic functions
- An Identity for the Coefficients of Certain Modular Forms
This page was built for publication: Proof of the Bessenrodt-Ono inequality by induction
