Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold

We give a new insight into the upper bounding of the 3-SAT threshold by the first moment method. The best criteria developed so far to select the solutions to be counted discriminate among neighboring solutions on the basis of uniform information about each individual free variable. What we mean by uniform information, is information which does not depend on the solution: e.g. the number of positive/negative occurrences of the considered variable. What is new in our approach is that we use non uniform information about variables. Thus we are able to make a more precise tuning, resulting in a slight improvement on upper bounding the 3-SAT threshold for various models of formulas defined by their distributions.

💡 Research Summary

The paper revisits the classic first‑moment method for establishing upper bounds on the random 3‑SAT satisfiability threshold and proposes a refined way of selecting which assignments to count. In the traditional approach, the set of assignments that contribute to the expectation is defined using only “uniform information” about each free variable – typically the total number of positive and negative occurrences of that variable in the formula. Such uniform criteria treat every assignment identically with respect to a given variable, regardless of how that variable is actually instantiated in the particular assignment. While this yields a tractable analysis, it often leads to a coarse over‑approximation of the solution space, which in turn produces a relatively loose upper bound.

The authors introduce the notion of “non‑uniform information”. Instead of relying solely on static statistics of the formula, they allow the selection rule to depend on the concrete truth value that a variable takes in a specific assignment. Concretely, for each free variable (x_i) they define a weight function (\phi_i) that takes as input both the literal’s polarity counts ((p_i,n_i)) and the actual value assigned to (x_i) in the candidate solution. The weight (\phi_i) can be linear, logarithmic, or any monotone function that reflects how “favorable” a particular assignment of (x_i) is with respect to the clause structure. The overall weight of an assignment (S) is then the product \