Hostname: page-component-7479d7b7d-68ccn Total loading time: 0 Render date: 2024-07-13T12:56:29.319Z Has data issue: false hasContentIssue false

Two Enumerative Proofs of an Identity of Jacobi

Published online by Cambridge University Press:  20 January 2009

C. Sudler Jr
Affiliation:
Los Angeles, California
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In (7), Wright gives an enumerative proof of an identity algebraically equivalent to that of Jacobi, namely

Here, and in the sequel, products run from 1 to oo and sums from - oo to oo unless otherwise indicated. We give here a simplified version of his argument by working directly with (1), the substitution leading to equation (3) of his paper being omitted. We then supply an alternative proof of (1) by means of a generalisation of the Durfee square concept utilising the rectangle of dimensions v by v + r for fixed r and maximal v contained in the Ferrers graph of a partition.

Type
Research Article
Copyright
Copyright © Edinburgh Mathematical Society 1966

References

REFERENCES

(1)Dickson, L. E., History of the Theory of Numbers, II, New York (Chelsea, 1952).Google Scholar
(2)Hardy, G. H. and Wright, E. M., An Introduction to the Theory of Numbers (3rd editionOxford, 1954)Google Scholar
(3)Hardy, G. H. and Wright, E. M.An Introduction to the Theory of Numbers (4th editionOxford, 1960)Google Scholar
(4)Macmahon, P. A.Combinatory Analysis, II (Cambridge, 1916).Google Scholar
(5)Sylvester, J. J.A constructive theory of partitions, Collected Papers, IV (Cambridge, 1912), 183.Google Scholar
(6)Vahlen, K. T.Beitrage zu einer additiven Zahlentheorie, J. fiir Math. 112 (1893), 136.Google Scholar
(7)Wright, E. M., An enumerative proof of an identity of Jacobi, J. London Math. Soc. 40 (1965), 5557.CrossRefGoogle Scholar