ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider the dynamical systems constructed from instances of the unique games conjecture, with alphabet size kk, and let the invariant measure assign weight to neighborhoods of optimal or feasible assignments. Unique-games invariant-measure transition conjecture. As the alphabet size kk increases, the weight of the invariant measure in the vicinity of an optimal or feasible assignment transitions from subexponential to exponential scaling. The proposed transition is motivated by the paper's numerical observations, which are described as consistent with the unique games conjecture; theoretical bounds on the decay rates remain future work.

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.