Related papers: Bernoulli Correlations and Cut Polytopes

Choose n random, independent points in R^d according to a fixed distribution. The convex hull of these points is a random polytope. In some cases, central limit theorems have been proven for the components of f-vectors of random polytopes…

For a given graph whose edges are labeled with general real numbers, we consider the set of functions from the vertex set into the Euclidean plane such that the distance between the images of neighbouring vertices is equal to the…

Recently, Benedetti et al. introduced an Ehrhart-like polynomial associated to a graph. This polynomial is defined as the volume of a certain flow polytope related to a graph and has the property that the leading coefficient is the volume…

A $\textit{polygonal curve}$ is a collection of $m$ connected line segments specified as the linear interpolation of a list of points $\{p_0, p_1, \ldots, p_m\}$. These curves may be obtained by sampling points from an oriented curve in…

It is shown that a simple closed curve in $\mathbb C^n$ that is a uniform limit of rectifiable simple closed curves each of which has nontrivial polynomial hull has itself nontrivial polynomial hull. In case the limit curve is rectifiable,…

We call the $\delta$-vector of an integral convex polytope of dimension $d$ flat if the $\delta$-vector is of the form $(1,0,\ldots,0,a,\ldots,a,0,\ldots,0)$, where $a \geq 1$. In this paper, we give the complete characterization of…

A smooth curve in the real projective plane is hyperbolic if its ovals are maximally nested. By the Helton-Vinnikov Theorem, any such curve admits a definite symmetric determinantal representation. We use polynomial homotopy continuation to…

We consider the hermitian random matrix model with external source and general polynomial potential, when the source has two distinct eigenvalues but is otherwise arbitrary. All such models studied so far have a common feature: an…

We generalize Milnor link invariants to all types of surface-links in $4$--space (possibly with boundary). This is achieved by using the notion of cut-diagram, which is a 2-dimensional generalization of Gauss diagrams, associated to…

We prove that a face of a cube can be optimally partitioned into connected 193 sets on which the cut locus, or ridge tree, is constant up to isomorphism as a labeled graph. These are 60 connected open sets, curves bounding them, and…

We give a characterization for the extreme points of the convex set of correlation matrices with a countable index set. A Hermitian matrix is called a correlation matrix if it is positive semidefinite with unit diagonal entries. Using the…

A real univariate polynomial of degree $n$ is called hyperbolic if all of its $n$ roots are on the real line. Such polynomials appear quite naturally in different applications, for example, in combinatorics and optimization. The focus of…

In image detection, one problem is to test whether the set, though mostly consisting of uniformly scattered points, also contains a small fraction of points sampled from some (a priori unknown) curve, for example, a curve with…

We study vectors chosen at random from a compact convex polytope in $\mathbb{R}^n$ given by a finite number of linear constraints. We determine which projections of these random vectors are asymptotically normal as $n\to\infty$. Marginal…

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…

Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…

The polytope of integer partitions of $n$ is the convex hull of the corresponding $n$-dimensional integer points. Its vertices are of importance because every partition is their convex combination. Computation shows intriguing features of…

We characterize all possible relative positions between a hyperboloid of one sheet and a sphere through the roots of a characteristic polynomial associated to these quadrics. The classification is also suitable for a hyperboloid and a…

We study distributed protocols for finding all pairs of similar vectors in a large dataset. Our results pertain to a variety of discrete metrics, and we give concrete instantiations for Hamming distance. In particular, we give improved…