Abstract
Using a combinatorial bijection with certain abaci diagrams, Nath and Sellers have enumerated $(s,ms\pm 1)$-core partitions into distinct parts. We generalize their result in several directions by including the number of parts of these partitions, by considering $d$-distinct partitions, and by allowing more general $(s,ms\pm r)$-core partitions. As an application of our approach, we obtain the average and maximum number of parts of these core partitions.
Highlights
If λ1 λ2 · · · λr 1, where the parts λi are integers, λ = (λ1, λ2, . . . , λr) is an partition of |λ| = λ1 + · · · + λr
The Young diagram of a partition λ is a left-justified array of square cells, where the first row contains λ1 cells, the second row λ2 cells, and so on
In the case 1 r d, applying Lemma 5 with ms in place of s, we find that every (s, ms + r)-core partition into d-distinct parts has maximum hook length < ms + r
Summary
Nath and Sellers [13] proved (the case of (s, ms + 1)-core partitions of) Theorem 1 combinatorially by viewing the partitions as certain abaci In light of Lemma 6, we prove Theorem 2 as a special case of our Theorems 12 and 14 (as well as Lemma 15, in the case r = −1 and s = 2d + 2, and Lemma 17 in the case r = −1 and d = 1) on certain abaci It follows from Theorem 12 that the condition r d can be dropped if is modified to be the generating polynomial of parts of s-core partitions into d-distinct parts with largest hook of length less than ms + r.
Sign-in/Register to view highlights & summary 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 callDisclaimer: 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.
