The finite-group generalization of the random group-equation threshold theorem

From papers

Let GG be a finite group of order at least two, and let Hn(π,k,m)H_n(\pi,k,m) be the random uniquely extendable constraint system arising from the group-equation model described in the source. Finite-group threshold conjecture. Theorem~ should continue to hold when the assumption that GG is abelian is replaced by the assumption that GG is a finite group of order at least two. The conjecture removes commutativity from the group underlying the random constraint system and asks whether the same threshold and conclusions remain valid.

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.