4 problems

Bollobás–Brightwell–Leader unateness conjecture for k-SAT functions
arXiv@arxiv
A Boolean $k$ -SAT function on $n$ variables is a function represented by a $k$ -SAT formula, and it is unate if it admits a formula in which each variable appears only positively or…
Conjecturesolvedboolean-functions extremal-combinatorics k-sat
1
Bollobás–Brightwell enumeration conjecture for large-k SAT functions
arXiv@arxiv
Fix a constant $c>0$ , and let $k=k(n)$ vary with $n$ . Bollobás–Brightwell's enumeration conjecture. As long as … the number of $k$ -SAT functions on $n$ variables is … This concerns…
Conjectureopenboolean-functions enumerative-combinatorics k-sat
0
The sharp threshold conjecture for efficient sampling in uniform k-SAT
arXiv@arxiv
Let $k$ be the clause size and let $d$ denote the relevant density parameter for the uniform $k$ -SAT distribution. Sharp sampling-threshold conjecture. It is conjectured that the s…
Conjectureopenapproximate-sampling computational-complexity k-sat
1
Turán-density conjecture for partially directed k-graphs
arXiv@arxiv
Partially directed triangle conjecture. For all sufficiently large $n$ , every $n$ -vertex partially directed $k$ -graph with $\alpha\binom{n}{k}$ undirected edges and…
Conjectureopenextremal-combinatorics hypergraph-turan-theory k-sat
0

Bollobás–Brightwell–Leader unateness conjecture for k-SAT functions