Related papers: On Pairs of $f$-divergences and their Joint Range
Suppose an interval is put on a horizontal line with random roughness. With probability one it is supported at two points, one from the left, and another from the right from its center. We compute probability distribution of support points…
We generalize the joints problem to sets of varieties and prove almost sharp bound on the number of joints. As a special case, given a set of $N$ $2$-planes in $\mathbb{R}^6$, the number of points at which three $2$-planes intersect and…
We study the convergence and divergence of the wavelet expansion of a function in a Sobolev or a Besov space from a multifractal point of view. In particular, we give an upper bound for the Hausdorff and for the packing dimension of the set…
We establish a maximum principle for a two-point function in order to analyze the convexity of level sets of harmonic functions. We show that this can be used to prove a strict convexity result involving the smallest principal curvature of…
We consider a general conic mixed-binary set where each homogeneous conic constraint $j$ involves an affine function of independent continuous variables and an epigraph variable associated with a nonnegative function, $f_j$, of common…
A new approach to the local and global explanation is proposed. It is based on selecting a convex hull constructed for the finite number of points around an explained instance. The convex hull allows us to consider a dual representation of…
A geometric graph is a graph drawn in the plane so that its vertices and edges are represented by points in general position and straight line segments, respectively. A vertex of a geometric graph is called pointed if it lies outside of the…
Let $f:\mathbb{D}\to\mathbb{C}$ be a bounded analytic function. A set $K\subset\mathbb{D}$ which contains the point $1$ in its boundary is called a convergence set for $f$ at $1$ if $f(z)$ converges to some value $\zeta$ as $z\to1$ with…
In this article, we are going to introduce the weighted numerical range which is a further generalization both the c-numerical range and the rank k numerical range. If the boundaries of weighted numerical ranges of two matrices (possibly of…
The problem of f-divergence estimation is important in the fields of machine learning, information theory, and statistics. While several nonparametric divergence estimators exist, relatively few have known convergence properties. In…
The estimation of an f-divergence between two probability distributions based on samples is a fundamental problem in statistics and machine learning. Most works study this problem under very weak assumptions, in which case it is provably…
We prove that a $C^{1,1}$-smooth bounded domain $D$ in $\C^n$ is linearly convex if and only if the convex hull of any two discs in $D$ with common center lies in $D.$
Take any $d + 3$ points in $\mathbb{R}^d$. It is known that (a) if $d = 2k + 1$, then there are two linked $(k + 1)$-simplices with the vertices at these points; (b) if $d = 2k$, then there are two disjoint $(k + 1)$-tuples of these points…
Quantum f-divergences are a quantum generalization of the classical notion of f-divergences, and are a special case of Petz' quasi-entropies. Many well known distinguishability measures of quantum states are given by, or derived from,…
Motivated by previous efforts toward mathematically analyzing the treatment of monomials in spatial branch-and-bound, we study the convex hull of the graph of a simple monomial on a nonnegative box domain in arbitrary dimension, where at…
A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…
The distribution of the number of points of the closed simple random walk, visited a given number of times (the k-multiple point range) is analysed by a graph based approach. A general expression for the moments is derived. In this paper…
We show that if $u$ is a compactly supported distribution on the complex plane such that, for every pair of entire functions $f,g$, \[ \langle u,f\overline{g}\rangle=\langle u,f\rangle\langle u,\overline{g}\rangle, \] then $u$ is supported…
In this paper we focus on the tropical convex hull of convex sets and polyhedral complexes. We give a vertex description of the tropical convex hull of a line segment and a ray. %in \RR^{n+1}/\RR\mathbf{1}. Next we show that tropical convex…
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…