Related papers: A Product on Lorenz Hulls, Zonoids, and Vector Mea…
In this note we examine the volume of the convex hull of two congruent copies of a convex body in Euclidean $n$-space, under some subsets of the isometry group of the space. We prove inequalities for this volume if the two bodies are…
We investigate new convex relaxations for the pooling problem, a classic nonconvex production planning problem in which input materials are mixed in intermediate pools, with the outputs of these pools further mixed to make output products…
The natural logarithm can be represented by an infinite series that converges for all positive real values of the variable, and which makes concavity patently obvious. Concavity of the natural logarithm is known to imply, among other…
We present a characterization, in terms of projective biduality, for the hypersurfaces appearing in the boundary of the convex hull of a compact real algebraic variety.
Let $\LL_{\bf v}\subset \Z^D$ be a suitable cone semigroup and $\A_{\bf v}$ its reduced semigroup $C^*$-algebra. In this paper, we compute the $\LL_{\bf v}$-invariant measures in the transversal hull of the semigroup $\LL_{\bf v}$ that…
We give a dimension formula for the space of logarithm-free series solutions to an A-hypergeometric (or a GKZ hypergeometric) system. In the case where the convex hull spanned by A is a simplex, we give a rank formula for the system,…
We give further insights into the weighted Hurwitz product and the weighted tensor product of Joyal species. Our first group of results relate the Hurwitz product to the pointwise product, including the interaction with Rota--Baxter…
Jensen's inequality is ubiquitous in measure and probability theory, statistics, machine learning, information theory and many other areas of mathematics and data science. It states that, for any convex function $f\colon K \to \mathbb{R}$…
The aim of this paper is to describe the closure of the numerical range of the product of two orthogonal projections in Hilbert space as a closed convex hull of some explicit ellipses parametrized by points in the spectrum. Several…
This article offers a comprehensive survey of results obtained for solitons and complex nonlinear wave patterns supported by purely nonlinear lattices (NLs), which represent a spatially periodic modulation of the local strength and sign of…
In this article, a new solution for the convex hull problem has been presented. The convex hull is a widely known problem in computational geometry. As nature is a rich source of ideas in the field of algorithms, the solution has been…
An orbitope is the convex hull of an orbit of a point under the action of a compact group. We derive bounds on volumes of sections of polar bodies of orbitopes, extending our previously developed methods. As an application we realize the…
We suggest a concept of generalized `angles' in arbitrary real normed vector spaces. We give for each real number a definition of an `angle' by means of the shape of the unit ball. They all yield the well known Euclidean angle in the…
The polyhedral product is a space constructed from a simplicial complex and a collection of pairs of spaces, which is connected with the Stanley Reisner ring of the simplicial complex via cohomology. Generalizing the previous work Grbic and…
Steinitz's theorem states that if a point $a \in \mathrm{int\,conv\,} X$ for a set $X \subset \mathbb{R}^d$, then $X$ contains a subset $Y$ of size at most $2d$ such that $a \in \mathrm{int\,conv\,}Y$. The bound $2d$ is best possible here.…
The vertices of the integer hull are the integral equivalent to the well-studied basic feasible solutions of linear programs. In this paper we give new bounds on the number of non-zero components -- their support -- of these vertices…
A physical measure on the attractor of a system describes the statistical behavior of typical orbits. An example occurs in unimodal dynamics. Namely, all infinitely renormalizable unimodal maps have a physical measure. For Lorenz dynamics,…
The Ehrhart polynomial $ehr_P (n)$ of a lattice polytope $P$ gives the number of integer lattice points in the $n$-th dilate of $P$ for all integers $n\geq 0$. The degree of $P$ is defined as the degree of its $h^\ast$-polynomial, a…
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…
We describe an algorithm for computing the convex hull of a finite collection of points in the affine building of SL_d(K), for K a field with discrete valuation. These convex hulls describe the relations among a finite collection of…