Abstract
We prove a finite version of the well-known theorem that says that the number of partitions of an integer N into distinct parts is equal to the number of partitions of N into odd parts. Our version says that the number of “lecture hall partitions of length n ” of N equals the number of partitions of N into small odd parts: 1,3,5, ldots, 2n-1 . We give two proofs: one via Bott's formula for the Poincare series of the affine Coxeter group \(\tilde C_n \), and one direct proof.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.