← All problems

Armstrong's average-size conjecture for (a,b)(a,b)-core partitions

12 years old · traced to

Let aa and bb be positive integers, and let an (a,b)(a,b)-core partition be a partition with no hook length divisible by either aa or bb. For a partition λ\lambda, write ∣λ∣|\lambda| for its size. If gcd⁡(a,b)=1\gcd(a,b)=1, then Armstrong's conjecture.

∑λ∣λ∣=(a−1)(b−1)(a+b+1)24(a+b)(a+ba),\sum_{\lambda} |\lambda|=\frac{(a-1)(b-1)(a+b+1)}{24(a+b)}\binom{a+b}{a},

where the sum is over all (a,b)(a,b)-core partitions. Equivalently, the average size of an (a,b)(a,b)-core partition is

(a−1)(b−1)(a+b+1)24.\frac{(a-1)(b-1)(a+b+1)}{24}.

The conjecture predicts the total and average sizes of the finite set of (a,b)(a,b)-core partitions; it was informally proposed by Armstrong in 2011 and later published.

References

Status

  • Solved: Paul Johnson. Lattice Points and Simultaneous Core Partitions (Electronic Journal of Combinatorics 25(3), Paper P3.47, 2018) https://doi.org/10.37236/5734

Source: Amol Aggarwal, “Armstrong's Conjecture for (k, mk + 1)-Core Partitions”, arXiv:1407.5134 (2015).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.