A formula for the partition function that ``counts

DOI10.1007/S00026-016-0305-1zbMATH Open1353.05013arXiv1811.09327OpenAlexW3103924409MaRDI QIDQ295286FDOQ295286

Yuriy Choliy, Andrew V. Sills

Publication date: 13 June 2016

Published in: Annals of Combinatorics (Search for Journal in Brave)

Abstract: We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then study $D(n,k)$ as a quasipolynomial. We consider the natural polynomial approximation $ildeD(n,k)$ to the quasipolynomial representation of $D(n,k)$. Numerically, the sum $su{m}_{1leqkleqsqrtn}ildeD(n,k)$ appears to be extremely close to the initial term of the Hardy--Ramanujan--Rademacher convergent series for $p(n)$.

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

Recommendations

• An arithmetic formula for the partition function
• An explicit formula for computing the partition numbers \(p(n)\)
• scientific article; zbMATH DE number 1441861
• On the Partition Function p (n )
• scientific article; zbMATH DE number 3104605
• A General Asymptotic Formula for Partition Functions
• scientific article; zbMATH DE number 878583
• A formula for the number of partitions of \(n\) in terms of the partial Bell polynomials
• scientific article; zbMATH DE number 3104598

zbMATH Keywords

partition functioninteger partitionsDurfee square

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)

Cites Work

• Formulæ for the number of partitions of \(n\) into at most \(m\) parts (using the quasi-polynomial ansatz)
• Title not available (Why is that?)
• An index to quantify an individual's scientific research output
• Title not available (Why is that?)
• Algebraic formulas for the coefficients of half-integral weight harmonic weak Maass forms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Partition Function p (n )
• A partition function connected with the modulus five
• Computing the integer partition function
• Rademacher's infinite partial fraction conjecture is (almost certainly) false
• The Final Problem : An Account of the Mock Theta Functions

Cited In (8)

• A combinatorial generalization of the Durfee square
• Title not available (Why is that?)
• Nuclear partitions and a formula for $p(n)$
• Title not available (Why is that?)
• A generalization of partition identities for first differences of partitions of \(n\) into at most \(m\) parts
• An explicit formula for computing the partition numbers \(p(n)\)
• Title not available (Why is that?)
• Formulas for the number of partitions related to the Rogers-Ramanujan identities

Uses Software

• PARTITIONS
• OEIS
• HANS

This page was built for publication: A formula for the partition function that ``counts

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