On the satisfiability threshold and clustering of solutions of random 3-SAT formulas

Abstract

We study the structure of satisfying assignments of a random 3- Sat formula. In particular, we show that a random formula of density α ≥ 4.453 almost surely has no non-trivial “core” assignments. Core assignments are certain partial assignments that can be extended to satisfying assignments, and have been studied recently in connection with the Survey Propagation heuristic for random Sat. Their existence implies the presence of clusters of solutions, and they have been shown to exist with high probability below the satisfiability threshold for k - Sat with k ≥ 9 [D. Achlioptas, F. Ricci-Tersenghi, On the solution-space geometry of random constraint satisfaction problems, in: Proc. 38th ACM Symp. Theory of Computing, STOC, 2006, pp. 130–139]. Our result implies that either this does not hold for 3- Sat, or the threshold density for satisfiability in 3- Sat lies below 4.453. The main technical tool that we use is a novel simple application of the first moment method.