Going after the k-SAT Threshold

Random $k$-SAT is the single most intensely studied example of a random constraint satisfaction problem. But despite substantial progress over the past decade, the threshold for the existence of satisfying assignments is not known precisely for any $k\geq3$. The best current results, based on the second moment method, yield upper and lower bounds that differ by an additive $k\cdot \frac{\ln2}2$, a term that is unbounded in $k$ (Achlioptas, Peres: STOC 2003). The basic reason for this gap is the inherent asymmetry of the Boolean value true' and false’ in contrast to the perfect symmetry, e.g., among the various colors in a graph coloring problem. Here we develop a new asymmetric second moment method that allows us to tackle this issue head on for the first time in the theory of random CSPs. This technique enables us to compute the $k$-SAT threshold up to an additive $\ln2-\frac12+O(1/k)\approx 0.19$. Independently of the rigorous work, physicists have developed a sophisticated but non-rigorous technique called the “cavity method” for the study of random CSPs (M'ezard, Parisi, Zecchina: Science 2002). Our result matches the best bound that can be obtained from the so-called “replica symmetric” version of the cavity method, and indeed our proof directly harnesses parts of the physics calculations.

💡 Research Summary

The paper tackles one of the most stubborn open problems in the theory of random constraint satisfaction problems (CSPs): determining the precise satisfiability threshold for random k‑SAT when k ≥ 3. For decades, the best rigorous bounds have been obtained by the second‑moment method, most notably by Achlioptas and Peres (STOC 2003). Their analysis yields a lower bound and an upper bound that differ by an additive term of k·(ln 2)/2, a gap that grows without bound as k increases. The authors identify the root cause of this gap: the inherent asymmetry between the Boolean values “true” and “false”. In contrast to problems such as graph coloring, where all colors are perfectly symmetric, random k‑SAT does not enjoy such symmetry, and the classical second‑moment calculations cannot properly control the variance introduced by biased assignments.

To overcome this obstacle, the authors develop what they call an “asymmetric second‑moment method”. The central idea is to introduce a bias parameter β_i for each variable, quantifying how much the variable prefers true over false (or vice‑versa). Rather than averaging over all assignments, the analysis restricts attention to the subspace of assignments that exhibit a prescribed bias vector β = (β_1,…,β_n). Within this subspace the expected number of satisfying assignments, E