Skip to content

A general counting and sampling Lovász local lemma

Sep 2026 · arXiv.org · Vol abs/2609.23671 · 0 citations · 10 references
Computer Science Mathematics

Abstract

Consider a constraint satisfaction problem $\mathbf{C}$ on finitely many independent random variables with dependency graph $G$. Let $p_a$ be the violation probability of a constraint $a\in \mathbf{C}$ and $N_G^2 (a)$ the set of constraints at distance one or two from $a$ in $G$. Suppose that, there exists $x\in (0,1)^{\mathbf{C}}$ such that, for a sufficiently small universal constant $c>0$, and for all $a \in \mathbf{C}$, \[ p_a \leq c \cdot x_a \prod_{b\in N_G^2(a)}(1-x_b). \] Under the above analog of the asymmetric Lov\'asz Local Lemma, we give an FPRAS for the probability that all constraints are satisfied, and an approximate sampler, running in polynomial expected time, for the product distribution conditioned on this event. The degree of the polynomial in the running time is independent of the domain sizes, constraint sizes, or degree of the dependency graph. Up to the choice of the constant $c$, our condition on $p_a$ matches known hardness results. Our work builds on the method of Liu, Wang, Yin, Zhang, and Zhou, who obtained an FPRAS for the probability of satisfaction in the setting of the symmetric Lov\'asz Local Lemma. Our sampling result is new even in this special case.

View source

Similar papers

Sep 2026

A sampling Lovász Local Lemma

We give an approximately uniform sampler for satisfying assignments of constraint satisfaction problems that satisfy $4\mathrm e p(\Delta+1)^2\le1$, where $p$ is the largest constraint-violation probability under the uniform product distribution, and $\Delta$ is the maximum degree of the dependency graph. The algorithm...

D. Achlioptas · 0 citations
Preprint Oct 2026

Tameness of transitive Boolean functions

Let $f_n:\{0,1\}^n\to\{0,1\}$ be Boolean functions, and let $C_n$ count their changes in a unit time interval under stationary dynamics in which each coordinate is independently resampled at rate one from the Bernoulli$(p_n)$ distribution. We prove that, if $f_n$ is transitive and $n\min\{p_n,1-p_n\}^{r}\to\infty$ for...

Xin Long · 0 citations
Preprint Oct 2026

A lower bound for additive complements to the primes

We prove that every set $\mathcal{B}\subseteq\mathbb{Z}_{\ge0}$ for which $\mathbb{P}+\mathcal{B}$ contains all sufficiently large integers satisfies $B(X)\gg\log X\log\log X$, where $B(X)=\#(\mathcal{B}\cap[0,X])$ and the implied constant is absolute. This proves a quantitative form of Ruzsa's Conjecture 2 and gives a...

A. Radomskii · 0 citations
Preprint Aug 2026

A subquadratic bound for generalized Tur\'an numbers of odd cycles

For a graph $H$ and a family of graphs $\mathcal F$, let $\text{ex}(n,H,\mathcal F)$ denote the maximum number of copies of $H$ in an $\mathcal F$-free graph on $n$ vertices. For every integer $i\ge 3$, let $C_i$ denote the cycle of length $i$. For $r\ge 3$, set $\mathscr {C}_r=\{C_3,C_4,\ldots,C_r\},$ and set $\mathsc...

Zhen Liu, Chuan-Shu Wu · 0 citations
Preprint Oct 2026

NP-hardness of additive approximation for generalized Tur\'{a}n problems

Given a graph $T$ and a nonempty family $\mathcal{F}$ of graphs, let $\operatorname{ex}(G, T, \mathcal{F})$ denote the maximum number of copies of $T$ in an $\mathcal{F}$-free subgraph of a host graph $G$. Alon and Shikhelman [Algorithmica, 2022] conjectured that if $e(T)>0$ and no member of $\mathcal{F}$ is a subgraph...

Yi-Han Chen, Jia-Lin He, Xi-He Li et al. · 1 citation · ⚡1
Preprint Sep 2026

Disproof of a Conjectured Upper Bound for the Davenport Constant

Let $G= C_{n_1}\oplus\cdots\oplus C_{n_r}$ be a finite abelian group with $1<n_1\mid\cdots\mid n_r$, and let $\rr(G)=r$ denote its rank. The Davenport constant $\DD(G)$ is the least integer $\ell$ such that every sequence of $\ell$ elements of $G$ contains a nonempty zero-sum subsequence, and $\DD^*(G)=1+\sum_{i=1}^r(n...

Guo-Qing Wang · 3 citations · ⚡1

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.