arXiv 2108.080672021-08math.COcond-mat.stat-mechcs.DMcs.LO

Exact enumeration of satisfiable 2-SAT formulae

Sergey Dovgal, Élie de Panafieu, Vlady Ravelomanana

备注：: 29 pages, 6 tables, 10 figures. For associated python code, see https://gitlab.com/sergey-dovgal/enumeration-2sat-aux

英文摘要：

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.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

随机 2-SAT 解的数量是渐近对数正态的

The number of random 2-SAT solutions is asymptotically log-normal

本文证明在整个可满足阶段，随机 2-SAT 公式满足赋值数量的对数满足中心极限定理，呈现 $\sqrt n$ 阶波动，区别于其他随机约束满足问题中受限的典型波动。

2024-09-20cs.DMmath.COmath.PR

A Randomized Algorithm for 3-SAT

In this work we propose and analyze a simple randomized algorithm to find a satisfiable assignment for a Boolean formula in conjunctive normal form (CNF) having at most 3 literals in every clause. Given a k-CNF formula phi on n variables, and alpha in{0,1}^n that satisfies phi, a clause of phi is critical if exactly one literal of that clause is satisfied under assignment alpha. Paturi et. al. (Chicago Journal of Theoretical Computer Science 1999) proposed a simple randomized algorithm (PPZ) for k-SAT for which success probability increases with the number of critical clauses (with respect to …

2009-06-10cs.DSmath.CO

Enumeration of Complex Golay Pairs via Programmatic SAT

We provide a complete enumeration of all complex Golay pairs of length up to 25, verifying that complex Golay pairs do not exist in lengths 23 and 25 but do exist in length 24. This independently verifies work done by F. Fiedler in 2013 that confirms the 2002 conjecture of Craigen, Holzmann, and Kharaghani that complex Golay pairs of length 23 don't exist. Our enumeration method relies on the recently proposed SAT+CAS paradigm of combining computer algebra systems with SAT solvers to take advantage of the advances made in the fields of symbolic computation and satisfiability checking. The enum…

2018-11-08cs.LOcs.SCmath.CO

The random 2-SAT partition function

We show that throughout the satisfiable phase the normalised number of satisfying assignments of a random $2$-SAT formula converges in probability to an expression predicted by the cavity method from statistical physics. The proof is based on showing that the Belief Propagation algorithm renders the correct marginal probability that a variable is set to `true' under a uniformly random satisfying assignment.

2020-02-10cs.DMmath.COmath.PR

The phase transition in random regular exact cover

A $k$-uniform, $d$-regular instance of Exact Cover is a family of $m$ sets $F_{n,d,k} = \{ S_j \subseteq \{1,...,n\} \}$, where each subset has size $k$ and each $1 \le i \le n$ is contained in $d$ of the $S_j$. It is satisfiable if there is a subset $T \subseteq \{1,...,n\}$ such that $|T \cap S_j|=1$ for all $j$. Alternately, we can consider it a $d$-regular instance of Positive 1-in-$k$ SAT, i.e., a Boolean formula with $m$ clauses and $n$ variables where each clause contains $k$ variables and demands that exactly one of them is true. We determine the satisfiability threshold for random ins…

2015-03-04cond-mat.stat-mechcs.CCmath.CO

Enumeration formulæ in neutral sets

We present several enumeration results holding in sets of words called neutral and which satisfy restrictive conditions on the set of possible extensions of nonempty words. These formulae concern return words and bifix codes. They generalize formulae previously known for Sturmian sets or more generally for tree sets. We also give a geometric example of this class of sets, namely the natural coding of some interval exchange transformations.

2015-03-20cs.DMmath.CO

更多相关论文收起更多论文

Finding cores of random 2-SAT formulae via Poisson cloning

For the random 2-SAT formula $F(n,p)$, let $F_C (n,p)$ be the formula left after the pure literal algorithm applied to $F(n,p)$ stops. Using the recently developed Poisson cloning model together with the cut-off line algorithm (COLA), we completely analyze the structure of $F_{C} (n,p)$. In particular, it is shown that, for $\gl:= p(2n-1) = 1+\gs $ with $\gs\gg n^{-1/3}$, the core of $F(n,p)$ has $\thl^2 n +O((\thl n)^{1/2})$ variables and $\thl^2 \gl n+O((\thl n))^{1/2}$ clauses, with high probability, where $\thl$ is the larger solution of the equation $þ- (1-e^{-\thl \gl})=0$. We also estim…

2008-08-12cs.CCmath.COmath.PR

关于可满足k-CSP的近似性：IV

On Approximability of Satisfiable k-CSPs: IV

本文证明了满足温和连通性条件下一般三元相关性的稳定性定理，刻画了高相关函数必来源于常数大小阿贝尔群的结构，并给出改进的直积定理和限制逆定理，应用于PCP与组合数学。

2024-08-01cs.CCmath.CO

2-Xor revisited: satisfiability and probabilities of functions

The problem 2-Xor-Sat asks for the probability that a random expression, built as a conjunction of clauses $x \oplus y$, is satisfiable. We revisit this classical problem by giving an alternative, explicit expression of this probability. We then consider a refinement of it, namely the probability that a random expression computes a specific Boolean function. The answers to both problems involve a description of 2-Xor expressions as multigraphs and use classical methods of analytic combinatorics by expressing probabilities through coefficients of generating functions.

2015-11-24math.COmath.PR

Random MAX SAT, Random MAX CUT, and Their Phase Transitions

Given a 2-SAT formula $F$ consisting of $n$ variables and $\cn$ random clauses, what is the largest number of clauses $\max F$ satisfiable by a single assignment of the variables? We bound the answer away from the trivial bounds of $(3/4)cn$ and $cn$. We prove that for $c<1$, the expected number of clauses satisfiable is $\cn-Θ(1/n)$; for large $c$, it is $((3/4)c + Θ(\sqrt{c}))n$; for $c = 1+\eps$, it is at least $(1+\eps-O(\eps^3))n$ and at most $(1+\eps-Ω(\eps^3/\ln \eps))n$; and in the ``scaling window'' $c= 1+Θ(n^{-1/3})$, it is $cn-Θ(1)$. In particular, just as the decision problem under…

2003-06-13math.COmath.PR

关于可满足k-CSP的近似性：VI

On Approximability of Satisfiable $k$-CSPs: VI

本文针对成对连通分布上的三元相关性证明了局部与全局逆定理，并利用密度增量论证将其应用于性质测试与加法组合学，首次为有限域上的受限3-AP问题给出了合理界限。

2024-11-22cs.CCmath.CO

Enumeration of Grothendieck's dessins and KP hierarchy

Branched covers of the complex projective line ramified over $0,1$ and $\infty$ (Grothendieck's {\em dessins d'enfant}) of fixed genus and degree are effectively enumerated. More precisely, branched covers of a given ramification profile over $\infty$ and given numbers of preimages of $0$ and $1$ are considered. The generating function for the numbers of such covers is shown to satisfy a PDE that determines it uniquely modulo a simple initial condition. Moreover, this generating function satisfies an infinite system of PDE's called the KP (Kadomtsev-Petviashvili) hierarchy. A specification of …

2014-03-22math-phmath.AGmath.CO

Enumeration of $S$-omino towers and row-convex $k$-omino towers

We first enumerate a generalization of domino towers that was proposed by Tricia M. Brown (J. Integer Seq. 20 (2017)), which we call S-omino towers. We establish equations that the generating function must satisfy and then apply the Lagrange inversion formula to find a closed formula for the number of towers. We also show a connection to generalized Dyck paths and provide an explicit bijection. Finally, we consider the set of row-convex k-omino towers, introduced by Brown, and calculate an exact generating function.

2020-10-30math.CO