Proof of the Bessenrodt-Ono inequality by induction

DOI10.1007/S40993-021-00301-WzbMATH Open1480.05008arXiv2108.00191OpenAlexW3217499793WikidataQ114218082 ScholiaQ114218082MaRDI QIDQ2065747FDOQ2065747

Authors: Bernhard Heim, Markus Neuhauser 

Publication date: 13 January 2022

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

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.

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

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

zbMATH Keywords

integer partitionspolynomialspartition inequality

Mathematics Subject Classification ID

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

Cites Work

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

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)