Research indexJournal article
XIII.—The Generating Function of Solid Partitions
Wright
Proceedings of the Royal Society of Edinburgh Section A Mathematical and Physical Sciences1 Jan 1967
NobleIDark:/48914/w1/20260522/542A4144DOI10.1017/s0080454100008037
XIII.—The Generating Function of Solid Partitions
Wright · Proceedings of the Royal Society of Edinburgh Section A Mathematical and Physical Sciences · 1967 · Subscription
NobleIDark:/48914/w1/20260522/542A4144DOI10.1017/s0080454100008037
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
Abstract
Synopsis The generating function for the number of linear partitions was found by Euler, the method being almost trivial. That for plane partitions is due to Macmahon, but, even in a simplified form found by Chaundy, the proof is far from trivial. The number of solid partitions of n, i.e. the number of solutions of is denoted by r ( n ). It has often been conjectured that the generating function of r ( n ) is , but this is now known to be false. We write η( a, b, c ) for the generating function of the number of solutions of (1) subject to the additional condition that Macmahon 1916 found n( a , 1, 1) for general a . Here we find η( a, b, c ) for general a, b. c.