Related papers: A constructive proof of the general Lovasz Local L…
A generalization of the Hartogs theorem is proved for a class of Tubes structures. We assume that the intervening commutative Lie algebra admits at least a number of globally solvable generators greater or equal to the structure…
We prove the local boundedness for solutions to a class of obstacle problems with non-standard growth conditions. The novelty here is that we are able to establish the local boundedness under a sharp bound on the gap between the growth…
In this paper, a critical Kirchhoff equation with a logarithmic type subcritical term is considered in a bounded domain in $\mathbb{R}^4$. We view this problem as a critical elliptic equation with a nonlocal perturbation, and investigate…
LECTURE GIVEN AT TH2002. Given a set of Boolean variables, and some constraints between them, is it possible to find a configuration of the variables which satisfies all constraints? This problem, which is at the heart of combinatorial…
An important theorem of Banaszczyk (Random Structures & Algorithms `98) states that for any sequence of vectors of $\ell_2$ norm at most $1/5$ and any convex body $K$ of Gaussian measure $1/2$ in $\mathbb{R}^n$, there exists a signed…
A locally checkable labeling problem (LCL) on a group $\Gamma$ asks one to find a labeling of the Cayley graph of $\Gamma$ satisfying a fixed, finite set of "local" constraints. Typical examples include proper coloring and perfect matching…
The proof of Brouwer's fixed-point theorem based on Sperner's lemma is often presented as an elementary combinatorial alternative to advanced proofs based on algebraic topology. The goal of this note is to show that: (i) the combinatorial…
In this paper we prove the necessity of the main sufficient condition of Meinardus for sub exponential rate of growth of the number of structures, having multiplicative generating functions of a general form and establish a new necessary…
The partial coloring method is one of the most powerful and widely used method in combinatorial discrepancy problems. However, in many cases it leads to sub-optimal bounds as the partial coloring step must be iterated a logarithmic number…
We provide a relatively compact proof of the BPHZ theorem for regularity structures of decorated trees in the case where the driving noise satisfies a suitable spectral gap property, as in the Gaussian case. This is inspired by the recent…
The classical Mountain Pass Lemma of Ambrosetti-Rabinowitz has been studied, extended and modified in several directions. Notable examples would certainly include the generalization to locally Lipschitz functionals by K.C. Chang, analyzing…
In this paper we study possibilities of efficient reasoning in combinations of theories over possibly non-disjoint signatures. We first present a class of theory extensions (called local extensions) in which hierarchical reasoning is…
Proving proof-size lower bounds for $\mathbf{LK}$, the sequent calculus for classical propositional logic, remains a major open problem in proof complexity. We shed new light on this challenge by isolating the power of structural rules,…
We study Lefschetz fixed point formulas for constructible sheaves with higher-dimensional fixed point sets. Under fairly weak assumptions, we prove that the local contributions from them are expressed by some constructible functions…
We prove a general theorem showing that local good-$\lambda$ inequalities imply bounds in certain variable Orlicz spaces. We use this to prove results about variable Orlicz Hardy spaces in the unit disc.
The method of alternating projections (MAP) is a common method for solving feasibility problems. While employed traditionally to subspaces or to convex sets, little was known about the behavior of the MAP in the nonconvex case until 2009,…
We establish a Sewing lemma in the regime $\gamma \in \left( 0, 1 \right]$, constructing a Sewing map which is neither unique nor canonical, but which is nonetheless continuous with respect to the standard norms. Two immediate corollaries…
We prove that 3-query linear locally correctable codes over the Reals of dimension $d$ require block length $n>d^{2+\lambda}$ for some fixed, positive $\lambda >0$. Geometrically, this means that if $n$ vectors in $R^d$ are such that each…
In convex geometry, the Shapley-Folkman Lemma asserts that the nonconvexity of a Minkowski sum of $n$ dimensional bounded nonconvex sets does not accumulate once the number of summands exceeds the dimension $n$, and thus the sum becomes…
We consider search problems with nonobligatory inspection and single-item or combinatorial selection. A decision maker is presented with a number of items, each of which contains an unknown price, and can pay an inspection cost to observe…