A formula for the partition function that ``counts
From MaRDI portal
Abstract: We derive a combinatorial multisum expression for the number of partitions of with Durfee square of order . An immediate corollary is therefore a combinatorial formula for , the number of partitions of . We then study as a quasipolynomial. We consider the natural polynomial approximation to the quasipolynomial representation of . Numerically, the sum appears to be extremely close to the initial term of the Hardy--Ramanujan--Rademacher convergent series for .
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
Cites work
- scientific article; zbMATH DE number 2126631 (Why is no real title available?)
- scientific article; zbMATH DE number 3165539 (Why is no real title available?)
- scientific article; zbMATH DE number 1222942 (Why is no real title available?)
- scientific article; zbMATH DE number 1033382 (Why is no real title available?)
- scientific article; zbMATH DE number 818088 (Why is no real title available?)
- scientific article; zbMATH DE number 3399320 (Why is no real title available?)
- A partition function connected with the modulus five
- Algebraic formulas for the coefficients of half-integral weight harmonic weak Maass forms
- An index to quantify an individual's scientific research output
- Computing the integer partition function
- Formulæ for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz)
- On the Partition Function p (n )
- Rademacher's infinite partial fraction conjecture is (almost certainly) false
- The Final Problem : An Account of the Mock Theta Functions
Cited in
(13)- A combinatorial generalization of the Durfee square
- Durfee square areas and associated partition identities.
- Estimates of five restricted partition functions that are quasi polynomials
- scientific article; zbMATH DE number 1441861 (Why is no real title available?)
- Diagonal hooks and a Schmidt-type partition identity
- Efficient implementation of the Hardy-Ramanujan-Rademacher formula
- 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)\)
- scientific article; zbMATH DE number 1775233 (Why is no real title available?)
- Formulæ for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz)
- Formulas for the number of partitions related to the Rogers-Ramanujan identities
- Nuclear partitions and a formula for \(p(n)\)
- A family of partitions equinumerous with the set of nodes of a family of trees
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)