On a new formula for the number of unrestricted partitions

DOI10.1007/S11139-019-00211-7MaRDI QIDQ829654zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 6 May 2021

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

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

zbMATH Keywords

matrix representationpartition identitiespartitions

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Elementary theory of partitions (11P81)

Abstract: In this paper we present a new formula for the number of unrestricted partitions of $n$. We do this by introducing a correspondence between the number of unrestrited partitions of $n$ and the number of non-negative solutions of systems of two equations, involving natural numbers in the interval (1 $,n^2$).

Recommendations

• On relations for the partitions of numbers
• scientific article; zbMATH DE number 3679916
• A new approach to integer partitions
• A family of partitions equinumerous with the set of nodes of a family of trees
• scientific article; zbMATH DE number 7282743

Cites work

• A new approach and generalizations to some results about mock theta functions
• A new approach to integer partitions
• Combinatorial interpretations as two-line array for the mock theta functions
• Generalized Frobenius partitions
• scientific article; zbMATH DE number 3129504 (Why is no real title available?)
• scientific article; zbMATH DE number 3355098 (Why is no real title available?)
• New two-line arrays representing partitions
• Simultane Darstellung zweier ganzen Zahlen als einer Summe von ganzen Zahlen und deren Quadratsumme
• SIMULTANEOUS QUADRATIC AND LINEAR REPRESENTATION
• Two-Fold Generalizations of Cauchy's Lemma

Cited in

(6)

• Universal formulas for the number of partitions
• scientific article; zbMATH DE number 3679916 (Why is no real title available?)
• New upper bounds for the number of partitions into a given number of parts
• A family of partitions equinumerous with the set of nodes of a family of trees
• On relations for the partitions of numbers
• The Bohr-Kalckar correspondence principle and a new construction of partitions in number theory

This page was built for publication: On a new formula for the number of unrestricted partitions

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