Polynomization of the Bessenrodt-Ono inequality

DOI10.1007/S00026-020-00509-0zbMath1460.05016arXiv1910.10413OpenAlexW3080499983MaRDI QIDQ2660059

Robert Tröger, Markus Neuhauser, Bernhard E. Heim

Publication date: 29 March 2021

Published in: Annals of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

partitionpolynomialpartition inequality

Mathematics Subject Classification ID

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

Related Items (6)

Polynomization of the Liu-Zhang inequality for the overpartition function ⋮ Cylinder quantum field theories at small coupling ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximal multiplicative properties of partitions
• Multiplicative properties of the number of \(k\)-regular partitions
• Log-concavity of the partition function
• Some inequalities for \(k\)-colored partition functions
• Combinatorial proof of a partition inequality of Bessenrodt-Ono
• Dyson's partition ranks and their multiplicative extensions
• The asymptotic profile of an eta-theta quotient related to entanglement entropy in string theory
• Effective bounds for the Andrews spt-function
• Variants of an partition inequality of Bessenrodt-Ono
• On cyclotomic factors of polynomials related to modular forms

This page was built for publication: Polynomization of the Bessenrodt-Ono inequality