Related papers: A Locale for Minimal Bad Sequences
Categorial methods for generating new local algebras from old ones are presented. A direct proof of the differential structure of the prolongations of a manifold is proposed.
We construct a seven-term exact sequence involving low degree cohomology spaces of a Lie algebra $\Lg$, an ideal $\Lh$ of $\Lg$ and the quotient $\Lg / \Lh$ with coefficients in a $\Lg$-module. The existence of such a sequence follows from…
We provide proofs for the fact that certain orders have no descending chains and no antichains.
We illustrate the use of probability theory in existential proofs, focusing on the Lov\'asz Local Lemma. This result gives a lower bound for the probability of avoiding a suitable finite collection of events. We describe some applications…
The Lovasz Local Lemma is a seminal result in probabilistic combinatorics. It gives a sufficient condition on a probability space and a collection of events for the existence of an outcome that simultaneously avoids all of those events.…
Lower semi-continuity (\texttt{LSC}) is a critical assumption in many foundational optimisation theory results; however, in many cases, \texttt{LSC} is stronger than necessary. This has led to the introduction of numerous weaker continuity…
The idea that many important classes of signals can be well-represented by linear combinations of a small set of atoms selected from a given dictionary has had dramatic impact on the theory and practice of signal processing. For practical…
We consider several examples of probabilistic existence proofs using compressibility arguments, including some results that involve Lov\'asz local lemma.
Mukhin found in 1984 an important necessary and sufficient condition for the validity of the local limit theorem. Revisiting the succint proof given in \cite{Mu2}, we could only prove rigorously a weaker necessary and sufficient condition,…
Minimal linear codes are algebraic objects which gained interest in the last twenty years, due to their link with Massey's secret sharing schemes. In this context, Ashikhmin and Barg provided a useful and a quite easy to handle sufficient…
The Lov\'{a}sz Local Lemma is a central tool in probabilistic combinatorics, providing a sufficient condition under which a finite collection of undesirable events with limited dependencies can be simultaneously avoided with positive…
The Lovasz Local Lemma [EL75] is a powerful tool to non-constructively prove the existence of combinatorial objects meeting a prescribed collection of criteria. In his breakthrough paper [Bec91], Beck demonstrated that a constructive…
We construct finite sets of real numbers that have a small difference set and strong local properties. In particular, we construct a set $A$ of $n$ real numbers such that $|A-A|=n^{\log_2 3}$ and that every subset $A'\subseteq A$ of size…
A necessary and sufficient condition on a sequence $\{\mathfrak{A}_n\}_{n\in \mathbb{N}}$ of $\sigma$-subalgebras that assures convergence almost every where of conditional expectations is given.
Given a recollement of three proper dg algebras over a noetherian commutative ring, e.g. three algebras which are finitely generated over the base ring, which extends one step downwards, it is shown that there is a short exact sequence of…
We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of…
Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…
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…
Let $k\leq n$ be two positive integers and $q$ a prime power. The basic question in minimal linear codes is to determine if there exists an $[n,k]_q$ minimal linear code. The first objective of this paper is to present a new sufficient and…
This paper presents a new alphabet-dependent bound for codes with hierarchical locality. Then, the complete list of possible localities is derived for a class of codes obtained by deleting specific columns from a Simplex code. This list is…