Title resolution pending

math.CO · 2026-04-22 · unverdicted · novelty 8.0

n(k1, k2) equals 2k1 + 2k2 - 4, proving the diagonal case conjecture and establishing the matching lower bound in general.

cs.CC · 2026-03-29 · accept · novelty 8.0

Graph theory characterizes BVA reencodings, proving any 2-CNF on n variables can be reduced to roughly 0.396 n²/lg n clauses with minor extra steps and that at-most-one needs at least 3n-6 clauses.

cs.CC · 2026-05-11 · unverdicted · novelty 7.0 · 2 refs

Gives an approximation algorithm for satisfiable instances of generalized linear equation CSPs over finite groups that is optimal for certain S, while the predicate remains approximation resistant on almost-satisfiable instances.

cs.DS · 2026-06-16 · unverdicted · novelty 6.0

Obtains a tight competitive ratio for the online Connectivity Augmentation Problem, improving prior bounds.