A combinatorial proof of a relationship between maximal (2k − 1, 2k + 1)-cores and (2k − 1, 2k, 2k + 1)-cores

Rishi Nath, James A. Sellers

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

Integer partitions which are simultaneously t-cores for distinct values of t have attracted significant interest in recent years. When s and t are relatively prime, Olsson and Stanton have determined the size of the maximal (s, t)-coreκs,t. When k ≥ 2, a conjecture of Amdeberhan on the maximal (2k − 1,2k,2k + 1)-core κ2k−1, 2k, 2k+1 has also recently been verified by numerous authors. In this work, we analyze the relationship between maximal (2k − 1, 2k + 1)-cores and maximal (2k − 1, 2k, 2k + 1)-cores. In previous work, the first author noted that, for all k ≥ 1, |κ2k−1,2k+1 | = 4|κ2k−1,2k,2k+1 | and requested a combinatorial interpretation of this unexpected identity. Here, using the theory of abaci, partition dissection, and elementary results relating triangular numbers and squares, we provide such a combinatorial proof.

Original languageEnglish (US)
JournalElectronic Journal of Combinatorics
Volume23
Issue number1
DOIs
StatePublished - Jan 22 2016

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A combinatorial proof of a relationship between maximal (2k − 1, 2k + 1)-cores and (2k − 1, 2k, 2k + 1)-cores'. Together they form a unique fingerprint.

Cite this