Abstract
SynopsisThe 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 ofis 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 thatMacmahon 1916 found n(a, 1, 1) for general a. Here we find η(a, b, c) for general a, b. c.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Proceedings of the Royal Society of Edinburgh. Section A. Mathematical and Physical Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
