arXiv Analytics

Sign in

arXiv:1407.5134 [math.CO]AbstractReferencesReviewsResources

Armstrong's Conjecture for $(k, mk + 1)$-Core Partitions

Amol Aggarwal

Published 2014-07-18, updated 2015-02-06Version 2

A conjecture of Armstrong states that if $\gcd (a, b) = 1$, then the average size of an $(a, b)$-core partition is $(a - 1)(b - 1)(a + b + 1) / 24$. Recently, Stanley and Zanello used a recursive argument to verify this conjecture when $a = b - 1$. In this paper we use a variant of their method to establish Armstrong's conjecture in the more general setting where $a$ divides $b - 1$.

Comments: 17 pages, 3 figures
Journal: European Journal of Combinatorics 47, 54-67 (2015)
Categories: math.CO, math.NT
Related articles: Most relevant | Search more
arXiv:1406.2583 [math.CO] (Published 2014-06-10, updated 2014-07-09)
On the Enumeration of $(s,s+1,s+2)$-Core Partitions
arXiv:1308.3669 [math.CO] (Published 2013-08-16, updated 2014-05-12)
A generalisation of core partitions
arXiv:2011.09989 [math.CO] (Published 2020-11-19)
Combinatorial results on $t$-cores and sums of squares