Core partitions into distinct parts and an analog of Euler's theorem

From MaRDI portal
Publication:298331

DOI10.1016/J.EJC.2016.04.002zbMATH Open1339.05025arXiv1601.07161OpenAlexW2963297924MaRDI QIDQ298331FDOQ298331

Armin Straub

Publication date: 20 June 2016

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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,ds1)-core partitions into distinct parts. 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.


Full work available at URL: https://arxiv.org/abs/1601.07161





Cites Work


Cited In (31)






This page was built for publication: Core partitions into distinct parts and an analog of Euler's theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q298331)