ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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. The supplied text does not state whether it has been proved or remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.