Polynomization of the Chern--Fu--Tang conjecture

TL;DR

This paper discusses recent advances in proving the Chern--Fu--Tang conjecture and its polynomization, including partial results, complete proofs, and a new approach for future proofs in partition theory.

Contribution

It provides new partial proofs of the conjecture, extends previous results, and proposes a general method for proving the conjecture in broader cases.

Findings

Complete proof of the Chern--Fu--Tang conjecture by Bringmann et al.

Proved several cases not covered by previous work.

Outlined a general approach for future proofs.

Abstract

Bessenrodt and Ono's work on additive and multiplicative properties of the partition function and DeSalvo and Pak's paper on the log-concavity of the partition function have generated many beautiful theorems and conjectures. In January 2020, the first author gave a lecture at the MPIM in Bonn on a conjecture of Chern--Fu--Tang, and presented an extension (joint work with Neuhauser) involving polynomials. Partial results have been announced. Bringmann, Kane, Rolen and Tripp provided complete proof of the Chern--Fu--Tang conjecture, following advice from Ono to utilize a recently provided exact formula for the fractional partition functions. They also proved a large proportion of Heim--Neuhauser's conjecture, which is the polynomization of Chern--Fu--Tang's conjecture. We prove several cases, not covered by Bringmann et.\ al. Finally, we lay out a general approach for proving the conjecture.