Polynomization of the Chern-Fu-Tang conjecture
From MaRDI portal
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.
Recommendations
Cites work
- Chromatic polynomials and logarithmic concavity
- 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
- scientific article; zbMATH DE number 2038304 (Why is no real title available?)
- Log-concavity of recursively defined polynomials
- Log-concavity of the partition function
- Maximal multiplicative properties of partitions
- Multiplicative properties of the number of k-regular partitions
- Polynomials related to powers of the Dedekind eta function
- Polynomization of the Bessenrodt-Ono inequality
- Powers of the Euler product and commutative subalgebras of a complex simple Lie algebra
- Preservation of log-concavity on summation
- Some inequalities for k-colored partition functions
- Sur les entiers n pour lesquels il y à beaucoup de groupes abéliens d'ordre \(n\)
- Variants of an partition inequality of Bessenrodt-Ono
Cited in
(11)- Proof of the Bessenrodt-Ono inequality by induction
- Trung's construction and the Charney-Davis conjecture
- Inequalities for plane partitions
- Fractional partitions and conjectures of Chern-Fu-Tang and Heim-Neuhauser
- Proof of Chapoton's conjecture on Newton polygons of \(q\)-Ehrhart polynomials
- 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
- Turán inequalities for infinite product generating functions
- On a general approach to Bessenrodt-Ono type inequalities and log-concavity properties
- Polynomization of Sun's conjecture
- Tangle sums and factorization of A-polynomials
This page was built for publication: Polynomization of the Chern-Fu-Tang conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2020010)