Related papers: Using the Incompressibility Method to obtain Local…

Ramsey's theorem, concerning the guarantee of certain monochromatic patterns in large enough edge-coloured complete graphs, is a fundamental result in combinatorial mathematics. In this work, we highlight the connection between this…

The lefthanded Lov\'asz local lemma (LLLL) is a generalization of the Lov\'asz local lemma (LLL), a powerful technique from the probabilistic method. We prove a computable version of the LLLL and use it to effectivize a collection of…

The Lov\'asz Local Lemma is a versatile result in probability theory, characterizing circumstances in which a collection of $n$ `bad events', each occurring with probability at most $p$ and dependent on a set of underlying random variables,…

We consider 3D free-boundary compressible elastodynamic system under the Rayleigh-Taylor sign condition. It describes the motion of an isentropic inviscid elastic medium with moving boundary. The deformation tensor satisfies the neo-Hookean…

This paper proves that a wide class of local search algorithms extend as is to the fully dynamic setting with an adaptive adversary, achieving an amortized $\tilde{O}(1)$ number of local-search steps per update. A breakthrough by Moser…

We give a Markov chain based algorithm for sampling almost uniform solutions of constraint satisfaction problems (CSPs). Assuming a canonical setting for the Lov\'asz local lemma, where each constraint is violated by a small number of…

Starting from the local-in-time classical solution to the compressible Euler system with impermeable boundary condition in half-space, by employing the coupled weak viscous layers (governed by linearized compressible Prandtl equations with…

This paper provides a general result on controlling local Rademacher complexities, which captures in an elegant form to relate the complexities with constraint on the expected norm to the corresponding ones with constraint on the empirical…

Rademacher complexity is often used to characterize the learnability of a hypothesis class and is known to be related to the class size. We leverage this observation and introduce a new technique for estimating the size of an arbitrary…

The Lov\'asz Local Lemma (the LLL for short) is a powerful tool in probabilistic combinatorics that is used to verify the existence of combinatorial objects with desirable properties. Recent years saw the development of various…

There is a wide range of applications where the local extrema of a function are the key quantity of interest. However, there is surprisingly little work on methods to infer local extrema with uncertainty quantification in the presence of…

Following the groundbreaking algorithm of Moser and Tardos for the Lovasz Local Lemma (LLL), there has been a plethora of results analyzing local search algorithms for various constraint satisfaction problems. The algorithms considered fall…

We establish efficient approximate counting algorithms for several natural problems in local lemma regimes. In particular, we consider the probability of intersection of events and the dimension of intersection of subspaces. Our approach is…

We provide local formulas for the pressure of incompressible fluids. The pressure can be expressed in terms of its average and averages of squares of velocity increments in arbitrary small neighborhoods. As application, we give a brief…

In this article, we study the pointwise asymptotic behavior of iterated convolutions on the one dimensional lattice Z. We generalize the so-called local limit theorem in probability theory to complex valued sequences. A sharp rate of…

In this paper we study the Leray weak solutions of the incompressible Navier Stokes equation in an exterior domain.We describe, in particular, an hyperbolic version of the so called artificial compressibility method investigated by…

Recently, Brandt, Maus and Uitto [PODC'19] showed that, in a restricted setting, the dependency of the complexity of the distributed Lov\'asz Local Lemma (LLL) on the chosen LLL criterion exhibits a sharp threshold phenomenon: They proved…

For the incompressible and the isentropic compressible Euler equations in arbitrary space dimension, we establish the principle of localised relative energy, thus generalising the well-known relative energy method. To this end, we adapt…

Through a reformulation of the local limit theorem and law of small numbers, which is obtained by working in the spaces naturally associated to the limiting distributions, we discover a general and abstract framework for the investigation…

We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popular lossless compression schemes: run-length encoding (RLE)…