Related papers: An alternative proof for the constructive Asymmetr…
We propose a new algorithmic framework, called "partial rejection sampling", to draw samples exactly from a product distribution, conditioned on none of a number of bad events occurring. Our framework builds (perhaps surprising) new…
We point out a close connection between the Moser-Tardos algorithmic version of the Lov\'asz Local Lemma, a central tool in probabilistic combinatorics, and the cluster expansion of the hard core lattice gas in statistical mechanics. We…
Let G be a graph on n vertices with maximum degree D. We use the Lov\'asz local lemma to show the following two results about colourings c of the edges of the complete graph K_n. If for each vertex v of K_n the colouring c assigns each…
In this paper, we propose a Bregman frame for several classical alternating minimization algorithms. In the frame, these algorithms have uniform mathematical formulation. We also present convergence analysis for the frame algorithm. Under…
The purpose of this paper is to generalize the classical Mazur's lemma from the classical convex analysis to the framework of locally $L^0$-convex modules. In this version an extra condition of countable concatenation is included. We…
We prove that the propositional translations of the Kneser-Lov\'asz theorem have polynomial size extended Frege proofs and quasi-polynomial size Frege proofs. We present a new counting-based combinatorial proof of the Kneser-Lov\'asz…
We reveal a connection between the incompressibility method and the Lovasz local lemma in the context of Ramsey theory. We obtain bounds by repeatedly encoding objects of interest and thereby compressing strings. The method is demonstrated…
We formulate and prove the analogue of Moser's stability theorem for locally conformally symplectic structures. As special cases we recover some results previously proved by Banyaga.
The Lopsided Lovasz Local Lemma (LLLL) is a cornerstone probabilistic tool for showing that it is possible to avoid a collection of "bad" events as long as their probabilities and interdependencies are sufficiently small. The strongest…
Firstly, we provide a different proof of an important lemma in Buzzard and Calegari's work on slopes of overconvergent 2-adic modular forms via nonarchimedean linear Hodge-Newton decomposition. The lemma shows that two equivalent matrices…
The famous Lovasz Local Lemma [EL75] is a powerful tool to non-constructively prove the existence of combinatorial objects meeting a prescribed collection of criteria. Kratochvil et al. applied this technique to prove that a k-CNF in which…
We suggest an alternative proof of a theorem due to Lambek and Moser using a perceptible model.
Following the groundbreaking Moser-Tardos algorithm for the Lovasz Local Lemma (LLL), a series of works have exploited a key ingredient of the original analysis, the witness tree lemma, in order to: derive deterministic, parallel and…
We formulate and prove an analog of the classical Morse-Darboux lemma for the case of a surface with boundary.
For most purposes, one can replace the use of Rolle's theorem and the mean value theorem, which are not constructively valid, by the law of bounded change. The proof of two basic results in numerical analysis, the error term for Lagrange…
Learning to generate complex combinatorial structures satisfying constraints will have transformative impacts in many application domains. However, it is beyond the capabilities of existing approaches due to the highly intractable nature of…
We investigate local computation algorithms (LCA) for two-coloring of $k$-uniform hypergraphs. We focus on hypergraph instances that satisfy strengthened assumption of the Lov\'{a}sz Local Lemma of the form $2^{1-\alpha k} (\Delta+1)…
This is the first of a series of papers that develop a systematic bridge between constructions in discrete mathematics and the corresponding continuous analogs. In this paper, we establish an equivalence between Forman's discrete Morse…
Recently, Glasner, Tsankov, Weiss, and Zucker showed that if $\Gamma$ is an infinite discrete group, then every minimal $\Gamma$-flow is disjoint from the Bernoulli shift $2^\Gamma$. Their proof is somewhat involved; in particular, it…
We give a new short self-contained proof of the result of Opozda [B. Opozda, A classification of locally homogeneous connections on 2-dimensional manifolds, Differential Geom. Appl. 21 (2004), 173-198.] classifying the locally homogeneous…