ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each of the three random labeled chip-firing protocols described in the source—uniformly choosing a legal firing move, uniformly choosing an unstable vertex and then a pair of chips there, or uniformly choosing a labeled stabilization sequence—consider the probability that the initial configuration Δ2m+1\Delta^{2m+1} sorts. Random labeled chip-firing probability conjecture. With respect to any of these three protocols, this probability converges to

13\frac{1}{3}

as m→∞m\to\infty. The conjecture predicts a common asymptotic sorting probability for three distinct randomization procedures. The source reports only limited simulations and gives no proof; it notes that the probability cannot have a limiting value greater than 1/31/3.

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.