The weakened-support conjecture for random uniquely extendable constraints

From papers

Let π\pi be a distribution over Λk,r\Lambda_{k,r}, and let Hn(π,k,m)H_n(\pi,k,m) be the associated random uniquely extendable constraint system. Weakened-support conjecture. Theorem~ should hold if either k4k\geq 4 and every ψsupp(π)\psi\in\operatorname{supp}(\pi) is reducible, or k=3k=3 and fψ(2)f_{\psi}^{(2)} is symmetric for every ψsupp(π)\psi\in\operatorname{supp}(\pi). This weakens the condition that the entire support is reducible and is motivated by the fact that symmetry of each individual fψ(2)f_{\psi}^{(2)} need not imply symmetry of F2(Ψ)F_2(\Psi).

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Pu Gao and Theodore Morrison, “The satisfiability threshold and solution space of random uniquely extendable constraint satisfaction problems”, arXiv:2512.13819 (2026).

Solutions 0

No solutions have been posted yet.