Related papers: Polytopal balls arising in optimization
If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…
Consider the problem of constructing an experimental design, optimal for estimating parameters of a given statistical model with respect to a chosen criterion. To address this problem, the literature usually provides a single solution.…
We make several new contributions to the study of proper holomorphic mappings between balls. Our results include a degree estimate for rational proper maps, a new gap phenomenon for convex families of arbitrary proper maps, and an…
In a given hypercube, draw grid lines parallel to the edges, and consider all hypercuboids (or hypercubes) whose edges are lying on the grid lines or the boundary. We find the limit of the value of the ratio of the arithmetic mean of the…
We define a statistical measure of the typical size of short words in a linear code over a finite field. We prove that the dual toric codes coming from polytopes of degree one are characterized, among all dual toric codes, by being extremal…
We study the equivariant Ehrhart theory of families of polytopes that are invariant under a non-trivial action of the group with order two. We study families of polytopes whose equivariant $H^*$-polynomial both succeed and fail to be…
We introduce the notion of a favourable module for a complex unipotent algebraic group, whose properties are governed by the combinatorics of an associated polytope. We describe two filtrations of the module, one given by the total degree…
The paper studies a general norm minimization problem on a product of normed vector spaces. We establish dual necessary and sufficient optimality conditions and derive explicit formulas for the corresponding solution sets. These formulas…
We study the polytopes of affine maps between two polytopes -- the hom-polytopes. The hom-polytope functor has a left adjoint -- tensor product polytopes. The analogy with the category of vector spaces is limited, as we illustrate by a…
We consider a minimum enclosing and maximum inscribed tropical balls for any given tropical polytope over the tropical projective torus in terms of the tropical metric with the max-plus algebra. We show that we can obtain such tropical…
We give upper bounds for the density of unit ball packings relative to their outer parallel domains and discuss their connection to contact numbers. Also, packings of soft balls are introduced and upper bounds are given for the fraction of…
Binary polynomial optimization is equivalent to the problem of minimizing a linear function over the intersection of the multilinear set with a polyhedron. Many families of valid inequalities for the multilinear set are available in the…
In this paper, we use multivariate splines to investigate the volume of polytopes. We first present an explicit formula for the multivariate truncated power, which can be considered as a dual version of the famous Brion's formula for the…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…
An explicit family of polynomials on the unit ball $B^d$ of $\RR^d$ is constructed, so that it is an orthonormal family with respect to the inner product $$ < f,g > = \rho \int_{B^d}\nabla f(x)\cdot \nabla g(x) dx + \CL (fg), $$ where $\rho…
Cosmological polytopes of graphs are a geometric tool in physics to study wavefunctions for cosmological models whose Feynman diagram is given by the graph. After their recent introduction by Arkani-Hamed, Benincasa and Postnikov the focus…
We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…
We consider two families of hyperbolic polygons: ideal and ideal once-punctured, some of whose spikes are decorated with horoballs. We show that the arc complexes of these two families of surfaces, generated by edge-to-edge arcs and…
We consider the volume of a Boolean expression of some congruent balls about a given system of centers in the $d$-dimensional Euclidean space. When the radius $r$ of the balls is large, this volume can be approximated by a polynomial of…