Polynomization of the Chern-Fu-Tang conjecture

DOI10.1007/s40993-021-00246-0zbMath1461.05012arXiv2011.11056OpenAlexW3138900414WikidataQ113891358 ScholiaQ113891358MaRDI QIDQ2020010

Bernhard E. Heim, Markus Neuhauser

Publication date: 23 April 2021

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

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

zbMATH Keywords

polynomialsinteger partitionspartition inequality

Mathematics Subject Classification ID

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

Related Items (4)

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 ⋮ 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
• Powers of the Euler product and commutative subalgebras of a complex simple Lie algebra
• Log-concavity of the partition function
• 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
• Exact formulae for the fractional partition functions
• Effective bounds for the Andrews spt-function
• Variants of an partition inequality of Bessenrodt-Ono
• Chromatic polynomials and logarithmic concavity
• Polynomization of the Bessenrodt-Ono inequality
• Preservation of log-concavity on summation

This page was built for publication: Polynomization of the Chern-Fu-Tang conjecture