ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PP be a point configuration on n2n^2 points, and let f(n,…,n)f^{(n,\ldots,n)} denote the number of standard Young tableaux of the square partition (n,…,n)(n,\ldots,n), equivalently the number of stable states of the identity configuration. For n∈Nn\in\mathbb{N}, the conjecture concerns the number of stable states of arbitrary point configurations on these points. Maximum stable-state count conjecture. The number of stable states of any point configuration PP on n2n^2 points is less than or equal to f(n,…,n)f^{(n,\ldots,n)}. This would identify the identity configuration as attaining the maximum number of stable states among configurations with n2n^2 points; the source reports supporting results for n∈{1,2,3}n\in\{1,2,3\} and computational experiments, but gives no resolution in general.

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.