Exact enumeration of satisfiable 2-SAT formulae
Abstract
We obtain exact expressions counting the satisfiable 2-SAT formulae and describe the structure of associated implication digraphs. Our approach is based on generating function manipulations. To reflect the combinatorial specificities of the implication digraphs, we introduce a new kind of generating function, the Implication generating function, inspired by the Graphic generating function used in digraph enumeration. Using the underlying recurrences, we make accurate numerical predictions of the phase transition curve of the 2-SAT problem inside the critical window. We expect these exact formulae to be amenable to rigorous asymptotic analysis using complex analytic tools, leading to a more detailed picture of the 2-SAT phase transition in the future.
Cite
@article{arxiv.2108.08067,
title = {Exact enumeration of satisfiable 2-SAT formulae},
author = {Sergey Dovgal and Élie de Panafieu and Vlady Ravelomanana},
journal= {arXiv preprint arXiv:2108.08067},
year = {2022}
}
Comments
29 pages, 6 tables, 10 figures. For associated python code, see https://gitlab.com/sergey-dovgal/enumeration-2sat-aux