Related papers: A constructive proof of the general Lovasz Local L…
The Lov\'{a}sz Local Lemma (LLL) is a keystone principle in probability theory, guaranteeing the existence of configurations which avoid a collection $\mathcal B$ of "bad" events which are mostly independent and have low probability. In its…
Almost 10 years ago, Impagliazzo and Kabanets (2010) gave a new combinatorial proof of Chernoff's bound for sums of bounded independent random variables. Unlike previous methods, their proof is constructive. This means that it provides an…
We give a constructive proof of the classical Cauchy-Kovalevskaya theorem in the ODE setting which provides a sufficient condition for an initial value problem to have a unique analytic solution. Our proof is inspired by a modern functional…
We investigate connections between SAT (the propositional satisfiability problem) and combinatorics, around the minimum degree (number of occurrences) of variables in various forms of redundancy-free boolean conjunctive normal forms…
A recent theorem of Bissacot, et al. proved using results about the cluster expansion in statistical mechanics extends the Lov\'asz Local Lemma by weakening the conditions under which its conclusions holds. In this note, we prove an…
We give a proof of the Lieb-Thirring inequality on the kinetic energy of orthonormal functions by using a microlocal technique, in which the uncertainty and exclusion principles are combined through the use of the Besicovitch covering…
The Lov\'{a}sz Local Lemma (LLL) is a probabilistic tool which shows that, if a collection of "bad" events $\mathcal B$ in a probability space are not too likely and not too interdependent, then there is a positive probability that no…
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…
Farkas' lemma is an ubiquitous tool in optimisation, as it provides necessary and sufficient conditions to have $b \in A(P)$, where $P$ is a closed convex cone, $A$ is a (continuous) linear mapping and $b$ is a fixed vector. The standard…
The Schwartz-Zippel Lemma states that if a low-degree multivariate polynomial with coefficients in a field is not zero everywhere in the field, then it has few roots on every finite subcube of the field. This fundamental fact about…
This paper deals with the Lipschitz regularity of minimizers for a class of variational obstacle problems with possible occurance of the Lavrentiev phenomenon. In order to overcome this problem, the availment of the notions of relaxed…
We consider a combinatorial problem occurring naturally in a group theoretical setting and provide a constructive solution in a special case. More precisely, in 1999 the author established a logarithmic bound for the derived length of the…
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 show that the standard approach of minimal invariant sets, which applies Zorn's Lemma and is used to prove fixed point theorems for non-expansive mappings in Banach spaces can be applied without any reference to the full Axiom of Choice…
We explore the consequences of layering a Lambek proof system over an arbitrary (constraint) logic. A simple model-theoretic semantics for our hybrid language is provided for which a particularly simple combination of Lambek's and the proof…
This paper investigates the expressiveness of a fragment of first-order sentences in Gaifman normal form, namely the positive Boolean combinations of basic local sentences. We show that they match exactly the first-order sentences preserved…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…
In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…
Lov\'asz gave a short proof of Brooks' theorem by coloring greedily in a good order. We give a different short proof by reducing to the cubic case. Then we show how to extend the result to (online) list coloring via the Kernel Lemma.
We present a constructive proof of Tychonoff's fixed point theorem in a locally convex space for sequentially locally non-constant functions, As a corollary to this theorem we also present Schauder's fixed point theorem in a Banach space…