The maximum stable-state count conjecture for neighborhood grids
Statement
Let be a point configuration on points, and let denote the number of standard Young tableaux of the square partition , equivalently the number of stable states of the identity configuration. For , 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 on points is less than or equal to . This would identify the identity configuration as attaining the maximum number of stable states among configurations with points; the source reports supporting results for 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.