A variation on a theme of Sylvester — a smoother road to Göllnitz's (Big) theorem
✍ Scribed by Krishnaswami Alladi
- Book ID
- 104114182
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 698 KB
- Volume
- 196
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
Using graphical representation, a simple bijective proof of the following result is given: 'The number of partitions of a positive integer n into distinct odd parts equals the number of partitions of n into parts # 2 and differing by > 6, where the inequality is strict if a part is even'. A threeparameter refinement of this result is obtained and shown to be equivalent to a deep partition theorem of Giillnitz.
📜 SIMILAR VOLUMES
As observed by G. Mints, Definition 5 on page 262 is too restrictive and does not reflect our intention. What we really had in mind is formulated below. We apologize for this stupid oversight. Definition 5 (corrected) Let T be any theory which is formulated in a language L(T) comprising L 2 . Then