arXiv Analytics

Sign in

arXiv:1506.06186 [math.CO]AbstractReferencesReviewsResources

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

Rishi Nath, James A. Sellers

Published 2015-06-20Version 1

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 $\kappa_{s,t}$. When $k\geq 2$, a conjecture of Amdeberhan on the maximal $(2k-1,2k,2k+1)$-core $\kappa_{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\geq 1,$ $$ \vert \, \kappa_{2k-1,2k+1}\, \vert = 4\vert \, \kappa_{2k-1,2k,2k+1}\, \vert $$ 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.

Related articles: Most relevant | Search more
arXiv:1502.07674 [math.CO] (Published 2015-02-26)
Another combinatorial proof of a result of Zagier and Stanley
arXiv:1711.06511 [math.CO] (Published 2017-11-17)
Towards a Combinatorial proof of Gessel's conjecture on two-sided Gamma positivity: A reduction to simple permutations
arXiv:1710.10373 [math.CO] (Published 2017-10-28)
Combinatorial proof of an identity of Andrews--Yee