Polynomization of the Liu-Zhang inequality for the overpartition function

DOI10.1007/S11139-023-00711-7zbMath1525.05010OpenAlexW4367041451MaRDI QIDQ6060204

Xixi Li

Publication date: 3 November 2023

Published in: The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11139-023-00711-7

zbMATH Keywords

partitionoverpartitioncombinatorial proofpartition inequalitypolynomization

Mathematics Subject Classification ID

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

Related Items (1)

Estimate for the largest zeros of the D'Arcais polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximal multiplicative properties of partitions
• Multiplicative properties of the number of \(k\)-regular partitions
• Inequalities for the overpartition function
• A Rademacher type formula for partitions and overpartitions
• The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications
• Some inequalities for \(k\)-colored partition functions
• Log-concavity of the overpartition function
• Combinatorial proof of a partition inequality of Bessenrodt-Ono
• Dyson's partition ranks and their multiplicative extensions
• Polynomization of the Chern-Fu-Tang conjecture
• Proof of the Bessenrodt-Ono inequality by induction
• The Dedekind eta function and D'Arcais-type polynomials
• Polynomization of the Bessenrodt-Ono inequality
• Multiranks and classical theta functions
• Overpartitions
• Zeros of recursively defined polynomials
• Recurrence relations for polynomials obtained by arithmetic functions
• An Identity for the Coefficients of Certain Modular Forms

This page was built for publication: Polynomization of the Liu-Zhang inequality for the overpartition function