Abstract
A special case of an elegant result due to Anderson proves that the number of (s,s+1)-core partitions is finite and is given by the Catalan number Cs. Amdeberhan recently conjectured that the number of (s,s+1)-core partitions into distinct parts equals the Fibonacci number Fs+1. We prove this conjecture by enumerating, more generally, (s,ds−1)-core partitions into distinct parts (the special case d=1 was independently also proved by Xiong). We do this by relating them to certain tuples of nested twin-free sets.As a by-product of our results, we obtain a bijection between partitions into distinct parts and partitions into odd parts, which preserves the perimeter (that is, the largest part plus the number of parts minus 1). This simple but curious analog of Euler’s theorem appears to be missing from the literature on partitions.
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.