Related papers: A converse to linear independence criteria, valid …
We introduce an independence criterion based on entropy regularized optimal transport. Our criterion can be used to test for independence between two samples. We establish non-asymptotic bounds for our test statistic and study its…
In this paper we prove the theorem on freedom for relatively free Lie algebras with a single relation (analogous with the well-known result of Shirshov) and a generalized Freiheitssatz for relatively free Lie algebras (analogous with the…
In this paper we extend Fischler's quantitative generalization of Nesterenko's linear independence criterion, by weakening the hypotheses on the divisors of the coe cients of the linear forms and allowing (to some extent) the linear forms…
We prove new linear independence results for the values of generalized hypergeometric functions ${}_pF_q$ at several distinct algebraic points, over arbitrary algebraic number fields. Our approach combines constructions of type II Pad\'{e}…
A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new ``normalized information distance'', based on the noncomputable notion of…
We introduce a variant of the $k$-nearest neighbor classifier in which $k$ is chosen adaptively for each query, rather than supplied as a parameter. The choice of $k$ depends on properties of each neighborhood, and therefore may…
A local strict comparison theorem and some converse comparison theorems are proved for reflected backward stochastic differential equations under suitable conditions.
We present a new similarity measure based on information theoretic measures which is superior than Normalized Compression Distance for clustering problems and inherits the useful properties of conditional Kolmogorov complexity. We show that…
The logic LAE discussed in this paper is based on an approximate entailment relation. LAE generalises classical propositional logic to the effect that conclusions can be drawn with a quantified imprecision. To this end, properties are…
Let $r, \,m$ be positive integers. Let $x$ be a rational number with $0 \le x <1$. Consider $\Phi_s(x,z) =\displaystyle\sum_{k=0}^{\infty}\frac{z^{k+1}}{{(k+x+1)}^s}$ the $s$-th Lerch function with $s=1, 2, \cdots, r$. When $x=0$, this is a…
Our first result is a statement of a somewhat general form of a non-substitution theorem for linear programming problems, along with a very easy proof of the same. Subsequently, we provide an easy proof of theorem 1 in a 1979 paper of Olvi…
Analogues of Khintchine's Theorem in simultaneous Diophantine approximation in the plane are proved with the classical height replaced by fairly general planar distance functions or equivalently star bodies. Khintchine's transference…
We derive sufficient conditions for theories consisting of multiple vector fields, which could also couple to external fields, to be multi-field generalised Proca theories. The conditions are derived by demanding that the theories have the…
We establish several results regarding dividing and forking in NTP2 theories. We show that dividing is the same as array-dividing. Combining it with existence of strictly invariant sequences we deduce that forking satisfies the chain…
One of the purposes in this paper is to provide a better understanding of the alternance property which occurs in Chebyshev polynomial approximation and piecewise polynomial approximation problems. In the first part of this paper, we…
We generalize a version of Lavrent\'ev's theorem which says that a function that is continuous on a compact set K with connected complement and without interior points can be uniformly approximated as closely as desired by a polynomial…
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distance between two individual objects, for example, two…
We consider an useful in Variational Analysis tool -- Long Orbit or Empty Value (LOEV) principle -- in different settings, starting from more abstract to more defined. We prove, using LOEV principle, a number of basic results in Variational…
We take a different look at the problem of testing the independence of two metric-space-valued random variables using the distance correlation. Instead of testing if the distance correlation vanishes exactly, we are interested in the…
We present a new completely effective proof of the Lindemann-Weierstrass theorem based on algebraic independence methods. Although it is slightly weaker than the best known estimate due to A. Sert, it improves the best estimate due to M.…