Related papers: On extreme points of the diffusion polytope
The evolution of a closed two-dimensional surface driven by both mean curvature flow and a reaction--diffusion process on the surface is formulated into a system, which couples the velocity law not only to the surface partial differential…
We characterize the extreme points of the set of incentive-compatible mechanisms for screening problems with linear utility. Our framework subsumes problems with and without transfers, such as monopoly pricing, principal-optimal bilateral…
We approximate boundaries of convex polytopes by smooth hypersurfaces $Y=Y_\varepsilon$ with {\it positive mean curvatures} and, by using basic geometric relations between the scalar curvatures of Riemannin manifolds and the mean curvatures…
Mathematical models of diffusive transport underpin our understanding of chemical, biochemical and biological transport phenomena. Analysis of such models often focusses on relatively simple geometries and deals with diffusion through…
Adjacency polytopes, a.k.a. symmetric edge polytopes, associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In particular,…
Multivariate distributions are fundamental to modeling. Discrete copulas can be used to construct diverse multivariate joint distributions over random variables from estimated univariate marginals. The space of discrete copulas admits a…
We consider the problem of finding an optimal piecewise linear path (polygonal line) connecting two given points with the possibility of making n turns at some points (the absolute value of each turn angle does not exceed a prescribed…
This article introduces the theory of Veronese polytopes, a broad generalisation of cyclic polytopes. These arise as convex hulls of points on curves with one or more connected components, obtained as the image of the rational normal curve…
For matrix convex sets a unified geometric interpretation of notions of extreme points and of Arveson boundary points is given. These notions include, in increasing order of strength, the core notions of "Euclidean" extreme points, "matrix"…
We present an explicit closed-form formula for the vertices of the classical cut polytope $\operatorname{CUT}(n)$, defined as the convex hull of cut vectors of the complete graph $K_n$. Our derivation proceeds via a related polytope,…
Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…
We show that the polyhedron defined as the convex hull of the lattice points above the hyperbola $\left\{xy = n\right\}$ has between $\Omega(n^{1/3})$ and $O(n^{1/3} \log n)$ vertices. The same bounds apply to any hyperbola with rational…
We consider the following geometric optics problem: Construct a system of two reflectors which transforms a spherical wavefront generated by a point source into a beam of parallel rays. This beam has a prescribed intensity distribution. We…
The enumeration of normal surfaces is a key bottleneck in computational three-dimensional topology. The underlying procedure is the enumeration of admissible vertices of a high-dimensional polytope, where admissibility is a powerful but…
A general class of cross-diffusion systems for two population species in a bounded domain with no-flux boundary conditions and Lotka-Volterra-type source terms is analyzed. Although the diffusion coefficients are assumed to depend linearly…
We study the convex hulls of reachable sets of nonlinear systems with bounded disturbances and uncertain initial conditions. Reachable sets play a critical role in control, but remain notoriously challenging to compute, and existing…
This article describes a method to compute successive convex approximations of the convex hull of a set of points in R^n that are the solutions to a system of polynomial equations over the reals. The method relies on sums of squares of…
We investigate symmetric edge polytopes generated by Erd\H{o}s--R\'enyi random graphs in a high-dimensional regime. These objects provide a natural and largely unexplored model of random lattice polytopes, in which geometric properties are…
There is a well known analogy between the Laughlin trial wave function for the fractional quantum Hall effect, and the Boltzmann factor for the two-dimensional one-component plasma. The latter requires analytic continuation beyond the…
Local graph clustering and the closely related seed set expansion problem are primitives on graphs that are central to a wide range of analytic and learning tasks such as local clustering, community detection, nodes ranking and feature…