A formula for the partition function that ``counts

DOI10.1007/s00026-016-0305-1zbMath1353.05013arXiv1811.09327OpenAlexW3103924409MaRDI QIDQ295286

Yuriy Choliy, Andrew V. Sills

Publication date: 13 June 2016

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

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

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)

Related Items (4)

Formulas for the number of partitions related to the Rogers-Ramanujan identities ⋮ Nuclear partitions and a formula for $p(n)$ ⋮ A generalization of partition identities for first differences of partitions of \(n\) into at most \(m\) parts ⋮ Unnamed Item

Uses Software

• PARTITIONS
• OEIS
• HANS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An index to quantify an individual's scientific research output
• Formulæ for the number of partitions of \(n\) into at most \(m\) parts (using the quasi-polynomial ansatz)
• Algebraic formulas for the coefficients of half-integral weight harmonic weak Maass forms
• 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
• On the Partition Function p (n )

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