ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider a balls-in-bins process (Im(i))i∈[B],m≥0(I_m(i))_{i\in[B],m\geq 0} with feedback function ff in the almost-balanced regime. Here [B]={1,…,B}[B]=\{1,\ldots,B\}, and Π\Pi ranges over all permutations of [B][B]. Spencer's conjecture. For every permutation Π\Pi of [B][B] and every initial condition, with probability 11 there are infinitely many m≥0m\geq 0 such that

Im(Π(1))<Im(Π(2))<⋯<Im(Π(B)).I_m(\Pi(1))<I_m(\Pi(2))<\dots<I_m(\Pi(B)).

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 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.