Spencer's conjecture on infinitely recurring bin orderings
Statement
Consider a balls-in-bins process with feedback function in the almost-balanced regime. Here , and ranges over all permutations of . Spencer's conjecture. For every permutation of and every initial condition, with probability there are infinitely many such that
Equivalently, every possible ordering of the bins occurs infinitely often almost surely. The conjecture concerns the almost-balanced regime and asks whether the process visits every strict ordering infinitely often, regardless of its initial state; the supplied text gives no resolution.
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.