A Combinatorial Proof of a Partition Function Limit

DOI10.2307/2317528MaRDI QIDQ5614738zbMATH OpenOpenAlexFDO

Authors George E. Andrews

Publication date 1971

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2317528

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)

Recommendations

• On an elementary proof of some asymptotic formulas in the theory of partitions
• Combinatorial proof of a partition inequality of Bessenrodt-Ono
• Counting partitions on the abacus
• Determinantal inequalities for the partition function
• A simplified proof of the partition formula

Cited in

(10)

• An inequality and its application to Mahler's partition function
• Asymptotically trivial linear homogeneous partition inequalities
• Combinatorial proof of a partition inequality of Bessenrodt-Ono
• Generalizations of Stanley's theorem: combinatorial proofs and related inequalities
• Counting partitions on the abacus
• On an elementary proof of some asymptotic formulas in the theory of partitions
• A combinatorial proof of a partition perimeter inequality
• The log-behavior of \(\root n \of {p(n)}\) and \(\root n \of {p(n)/n}\)
• Polynomization of Sun's conjecture
• Log-concavity of the partition function

This page was built for publication: A Combinatorial Proof of a Partition Function Limit

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5614738)