ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn denote the width parameter and let Mblocks\mathcal{M}_{\mathit{blocks}} be the Markov-chain sampler on building block sequences described in the paper. Cubic mixing-time conjecture. The sampler Mblocks\mathcal{M}_{\mathit{blocks}} mixes in time O(n3)\mathcal{O}(n^3). The experimental results suggest polynomial rather than exponential dependence on the width, but no proof of the cubic bound is given here.

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.