Related papers: The EL Theorem

The best candidate for a fundamental unified theory of all physical phenomena is no longer ten-dimensional superstring theory but rather eleven-dimensional {\it M-theory}. In the words of Fields medalist Edward Witten, ``M stands for…

We generalize a theorem of Bellow and Calder\'on concerning the a.e. convergence of the convolution powers $\ds \mu^nf(x)=\sum_{k}\mu^n(k)f(T^k x)$ where $T$ is a measure preserving transformation of a probability space and $\mu$ is a…

Using the reduced formulation of large-N Quantum Field Theories we study strings in space-time dimensions higher than one. Some preliminary results concerning the possible string susceptibilities and general properties of the model are…

The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. From an optimization point of view, one could instead…

It is conjectured that within the class group of any number field, for every integer $\ell \geq 1$, the $\ell$-torsion subgroup is very small (in an appropriate sense, relative to the discriminant of the field). In nearly all settings, the…

Let $G$ be a regular graph and $H$ a subgraph on the same vertex set. We give surprisingly compact formulas for the number of copies of $H$ one expects to find in a random subgraph of $G$.

Let $s_1,s_2,\ldots s_n$ be states of a general probability theory, and $\mathcal A$ be the set of all subsets of indices $H \subset [n]\equiv\{1,2,\ldots n\}$ such that the states $(s_j)_{j\in H}$ are jointly perfectly distinguishable. All…

Finding an Approximate Longest Common Substring (ALCS) within a given set $S=\{s_1,s_2,\ldots,s_m\}$ of $m \ge 2$ strings is a key problem in computational biology, such as identifying related mutations across multiple genetic sequences. We…

We discuss the possibility of deriving an H-theorem for the nonlinear discrete time evolution known as Ulam's redistribution of energy problem. In this model particles are paired at random and then their total energy is redistributed…

A distribution of electromagnetic fields presents a statistical assembly of a particular type, which is at scale h a quantum statistical assembly itself and has also been instrumental to concretisation of the basic probability assumption of…

We describe general connections between intersective properties of sets in Abelian groups and positive exponential sums. In particular, given a set $A$ the maximal size of a set whose difference set avoids $A$ will be related to positive…

Suppose a string $X_1^n=(X_1,X_2,...,X_n)$ generated by a memoryless source $(X_n)_{n\geq 1}$ with distribution $P$ is to be compressed with distortion no greater than $D\geq 0$, using a memoryless random codebook with distribution $Q$. The…

The set of all m-tuples of compatible full conditional distributions on discrete random variables is an algebraic set whose defining ideal is a unimodular toric ideal. We identify the defining polynomials of these ideals with closed walks…

The authors present evidence for universality in numerical computations with random data. Given a (possibly stochastic) numerical algorithm with random input data, the time (or number of iterations) to convergence (within a given tolerance)…

The three-parameter generalized extreme value distribution arises from classical univariate extreme value theory and is in common use for analyzing the far tail of observed phenomena. Curiously, important asymptotic properties of…

Suppose $k$ balls are dropped into $n$ boxes independently with uniform probability, where $n, k$ are large with ratio approximately equal to some positive real $\lambda$. The maximum box count has a counterintuitive behavior: first of all,…

This paper shows that the normalized maximum likelihood~(NML) code-length calculated in [1] is an upper bound on the NML code-length strictly calculated for the Gaussian Mixture Model. When we use this upper bound on the NML code-length, we…

Consider the binomial model $G^{d+1}(n,p)$ of the random $(d+1)$-uniform hypergraph on $n$ vertices, where each edge is present, independently of one another, with probability $p:\mathbb{N}\to[0,1]$. We prove that, for all…

The cornerstone of any algorithm computing all repetitions in a string of length n in O(n) time is the fact that the number of runs (or maximal repetitions) is O(n). We give a simple proof of this result. As a consequence of our approach,…

Entity Linking (EL) is an essential task for semantic text understanding and information extraction. Popular methods separately address the Mention Detection (MD) and Entity Disambiguation (ED) stages of EL, without leveraging their mutual…