Related papers: A constructive proof of the general Lovasz Local L…

This paper presents a constructive proof of the existence of a regular non-atomic strictly-positive measure on any second-countable non-atomic locally compact Hausdorff space. This construction involves a sequence of finitely-additive set…

A new proof of Oka's lemma is given for smoothly bounded, pseudoconvex domains $D\subset\mathbb{C}^n$. The method of proof is then also applied to other convexity-like hypotheses on the boundary of $D$.

In this short paper, I recall the history of dealing with the lack of compactness of a sequence in the case of an unbounded domain and prove the vanishing Lions-type result for a sequence of Lebesgue-measurable functions. This lemma…

We extend the Gibbs conditioning principle to an abstract setting combining infinitely many linear equality constraints and non-linear inequality constraints, which need not be convex. A conditional large large deviation principle (LDP) is…

In this work, we investigate the bi-Lipschitz invariance of two fundamental local invariants in singularity theory: the {\L}ojasiewicz exponent and the local Euler obstruction. We draw inspiration from Bivi\`a-Ausina and Fukui, whose…

We propose to use Tarski's least fixpoint theorem as a basis to define recursive functions in the calculus of inductive constructions. This widens the class of functions that can be modeled in type-theory based theorem proving tool to…

A main property of support vector machines consists in the fact that only a small portion of the training data is significant to determine the maximum margin separating hyperplane in the feature space, the so called support vectors. In a…

We give a lower bound on the growth of a subshift based on a simple condition on the set of forbidden patterns defining that subshift. Aubrun et Al. showed a similar result based on the Lov\'asz Local Lemma for subshift over any countable…

In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The…

Let $K$ be a maximal lattice-free set in $\mathbb{R}^d$, that is, $K$ is convex and closed subset of $\mathbb{R}^d$, the interior of $K$ does not cointain points of $\mathbb{Z}^d$ and $K$ is inclusion-maximal with respect to the above…

We prove three switching lemmas, for random restrictions for which variables are set independently; for random restrictions where variables are set in blocks (both due to Hastad [Hastad 86]); and for a distribution appropriate for the…

In this paper we are concerned with some abstract results regarding to fractional Orlicz-Sobolev spaces. Precisely, we ensure the compactness embedding for the weighted fractional Orlicz-Sobolev space into the Orlicz spaces, provided the…

The aim of this paper is to determine the logical and computational strength of instances of the Bolzano-Weierstra{\ss} principle (BW) and a weak variant of it. We show that BW is instance-wise equivalent to the weak K\"onig's lemma for…

We present an exposition of the *Chain Bounding Lemma*, which is a common generalization of both Zorn's Lemma and the Bourbaki-Witt fixed point theorem. The proofs of these results through the use of Chain Bounding are amongst the simplest…

A classical theorem of Spencer shows that any set system with n sets and n elements admits a coloring of discrepancy O(n^1/2). Recent exciting work of Bansal, Lovett and Meka shows that such colorings can be found in polynomial time. In…

Zeckendorf proved that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers $\{F_n\}$, and later researchers showed that the distribution of the number of summands needed for such decompositions of integers in…

There are investigated problems connected with local and boundary properties of Orlicz--Sobolev classes of finite distortion which are actively studied last time. It is showed that, a locally uniform limit of local homeomorphisms of…

Explanations of the replication crisis often emphasize misconduct, questionable research practices, or incentive misalignment, implying that behavioral reform is sufficient. This paper argues that a substantial component is architectural:…

While Large Language Models (LLMs) demonstrate impressive performance in mathematics, existing math benchmarks come with significant limitations. Many focus on problems with fixed ground-truth answers, and are often saturated due to problem…

The theory of limits of discrete combinatorial objects has been thriving for the last decade or so. The syntactic, algebraic approach to the subject is popularly known as "flag algebras", while the semantic, geometric one is often…