On a new formula for the number of unrestricted partitions (Q829654)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7344935
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a new formula for the number of unrestricted partitions |
scientific article; zbMATH DE number 7344935 |
Statements
On a new formula for the number of unrestricted partitions (English)
0 references
6 May 2021
0 references
The relation between partitions and two-line matrices dates back to 1900 with the work of \textit{G. Frobenius} [Berl. Ber. 1900, 516--534 (1900; JFM 31.0129.02)]. These ideas have been further developed by other authors, especially \textit{G. E. Andrews} [Mem. Am. Math. Soc. 301, 44 p. (1984; Zbl 0544.10010)], which considered relations between these matricial representations and the elliptic theta functions. In this paper, the authors revisited and extend the results obtained in [\textit{J. P. O. Santos} and \textit{M. L. Matte}, Bull. Braz. Math. Soc. (N.S.) 49, No. 4, 811--847 (2018; Zbl 1443.11215)]. In this way, they provided a new correspondence between the number of unrestricted partitions of \(n\) and the number of non-negative solutions of systems of two equations, involving natural numbers in the interval \((1 , n^2)\).
0 references
partitions
0 references
matrix representation
0 references
partition identities
0 references
0 references
0.7990899085998535
0 references
0.7864128947257996
0 references
0.7724107503890991
0 references