Proof of the Bessenrodt-Ono inequality by induction

DOI10.1007/S40993-021-00301-WMaRDI QIDQ2065747zbMATH OpenOpenAlexWikidataFDO

Authors Bernhard Heim, Markus Neuhauser

Publication date 13 January 2022

Published in Research in Number Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2108.00191

zbMATH Keywords

integer partitionspolynomialspartition inequality

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Combinatorial inequalities (05A20) Analytic theory of partitions (11P82)

Abstract: In 2016 Bessenrodt--Ono discovered an inequality addressing additive and multiplicative properties of the partition function. Generalization by several authors have been given; on partitions with rank in a given residue class by Hou--Jagadeesan and Males, on $k$-regular partitions by Beckwith--Bessenrodt, on $k$-colored partitions by Chern, Fu, Tang, and Heim--Neuhauser on their polynomization, and Dawsey--Masri on the Andrews $itspt$-function. The proofs depend on non-trivial asymptotic formulas related to the circle method on one side, or a sophisticated combinatorial proof invented by Alanazi--Gagola--Munagi. We offer in this paper a new proof of the Bessenrodt--Ono inequality, which is built on a well-known recursion formula for partition numbers. We extend the proof to the result of Chern--Fu--Tang and its polynomization. Finally, we also obtain a new result.

Recommendations

• Combinatorial proof of a partition inequality of Bessenrodt-Ono
• Polynomization of the Bessenrodt-Ono inequality
• Variants of an partition inequality of Bessenrodt-Ono
• Inequalities for plane partitions
• Some inequalities for \(k\)-colored partition functions

Cites work

• scientific article; zbMATH DE number 2038304 (Why is no real title available?)
• An Identity for the Coefficients of Certain Modular Forms
• Asymptotic equidistribution and convexity for partition ranks
• Combinatorial proof of a partition inequality of Bessenrodt-Ono
• Dyson's partition ranks and their multiplicative extensions
• Effective bounds for the Andrews spt-function
• Exact formulae for the fractional partition functions
• Fractional partitions and conjectures of Chern-Fu-Tang and Heim-Neuhauser
• Higher order Turán inequalities for the partition function
• Jensen polynomials for the Riemann zeta function and other sequences
• Log-concavity of the partition function
• Maximal multiplicative properties of partitions
• Multiplicative properties of the number of k-regular partitions
• Polynomization of the Bessenrodt-Ono inequality
• Polynomization of the Chern-Fu-Tang conjecture
• Recurrence relations for polynomials obtained by arithmetic functions
• Seiberg-Witten theory and random partitions
• Some inequalities for \(k\)-colored partition functions
• Sur les entiers n pour lesquels il y à beaucoup de groupes abéliens d'ordre \(n\)
• The Dedekind eta function and D'Arcais-type polynomials
• The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications

Cited in

(6)

• Inequalities for plane partitions
• Polynomization of the Liu-Zhang inequality for the overpartition function
• Variants of an partition inequality of Bessenrodt-Ono
• Log-concavity of the restricted partition function \(p_{\mathcal{A}}(n, k)\) and the new Bessenrodt-Ono type inequality
• Combinatorial proof of a partition inequality of Bessenrodt-Ono
• Polynomization of the Bessenrodt-Ono type inequalities for \(A\)-partition functions

This page was built for publication: Proof of the Bessenrodt-Ono inequality by induction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2065747)