Nearly all $k$-SAT functions are unate
Abstract
We prove that a 1-o(1) fraction of all k -SAT functions of n Boolean variables are unate (i.e., monotone after first negating some variables), for any fixed positive integer k and as n \to \infty . This resolves a conjecture by Bollobás, Brightwell, and Leader from 2003.
Fields of Study & Subjects
Coding theory and cryptography
Publication details
- Journal / source
- Journal of the European Mathematical Society
- Publication date
- 14 May 2026
- Language
- EN