Related papers: On Pairs of $f$-divergences and their Joint Range
We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…
We consider the set of points chosen randomly, independently and uniformly in the $d$-dimensional spherical layer. A set of points is called $1$-convex if all its points are vertices of the convex hull of this set. In \cite{3} an estimate…
Balas introduced disjunctive cuts in the 1970s for mixed-integer linear programs. Several recent papers have attempted to extend this work to mixed-integer conic programs. In this paper we study the structure of the convex hull of a…
In the previous paper (arXiv:0804.0701), the authors gave criteria for A_{k+1}-type singularities on wave fronts. Using them, we show in this paper that there is a duality between singular points and inflection points on wave fronts in the…
We consider two dimensional nonstationary scattering of plane waves by a NN-wedge. We prove the existence and uniqueness of a solution to the corresponding mixed problem and we give an explicit formula for the solution. Also the Limiting…
For a given point set $S$ in a plane, we develop a distributed algorithm to compute the $\alpha-$shape of $S$. $\alpha-$shapes are well known geometric objects which generalize the idea of a convex hull, and provide a good definition for…
In this paper we discuss the relationship between the numerical range of an extensive class of unbounded operator functions and the joint numerical range of the operator coefficients. Furthermore, we derive methods on how to find estimates…
An interesting problem in classical differential geometry is to find methods to prove that two surfaces defined by different charts actually coincide up to position in space. In a previous paper we proposed a method in this direction for…
The purpose of this note is to present two elementary, but useful, facts concerning actions on uniformly convex spaces. We demonstrate how each of them can be used in an alternative proof of the triviality of the first $L_p$-cohomology of…
The 2-sets convex feasibility problem aims at finding a point in the intersection of two closed convex sets $A$ and $B$ in a normed space $X$. More generally, we can consider the problem of finding (if possible) two points in $A$ and $B$,…
The simplest way to generate a lattice of convex sets is to consider an initial set of points and draw segments, triangles, and any convex hull from it, then intersect them to obtain new points, and so forth. The result is an infinite…
Comparing and recognizing metrics can be extraordinarily difficult because of the group of diffeomorphisms. Two metrics, that could even be the same, could look completely different in different coordinates. This is the gauge problem. The…
In this work we deal with the problem of support estimation under shape restrictions. The shape restriction we deal with is an extension of the notion of convexity named alpha-convexity. Instead of assuming, as in the convex case, the…
Consider the Delaunay triangulation T of a set P of points in the plane as a Euclidean graph, in which the weight of every edge is its length. It has long been conjectured that the dilation in T of any pair p, p \in P, which is the ratio of…
Point configurations have been widely used as model systems in condensed matter physics, materials science and biology. Statistical descriptors such as the $n$-body distribution function $g_n$ is usually employed to characterize the point…
An n-dilation of a contraction T acting on a Hilbert space H is a unitary dilation acting on H \oplus C^n. We show that if both defect numbers of T are equal to n, then the closure of the numerical range of T is the intersection of the…
Scaffolds are certain tensors arising in the study of association schemes, and have been (implicitly) understood diagrammatically as digraphs with distinguished "root" nodes and with matrix edge weights, often taken from Bose-Mesner…
Given a finite set of lattice points, we compare its sumsets and lattice points in its dilated convex hulls. Both of these are known to grow as polynomials. Generally, the former are subsets of the latter. In this paper, we will see that…
In this paper we consider the convex hull of a spherically symmetric sample in $R^d$. Our main contributions are some new asymptotic results for the expectation of the number of vertices, number of facets, area and the volume of the convex…
In this paper, two parallel notions of convexity of sets are introduced in the abelian semigroup setting. The connection of these notions to algebraic and to set-theoretic operations is investigated. A formula for the computation of the…