Related papers: Polytopal balls arising in optimization
Tropical polytopes are images of polytopes in an affine space over the Puiseux series field under the degree map. This viewpoint gives rise to a family of cellular resolutions of monomial ideals which generalize the hull complex of Bayer…
Higher bundles are homotopy coherent generalisations of classical fibre bundles. They appear in numerous contexts in geometry, topology and physics. In particular, higher principal bundles provide the geometric framework for higher-group…
An orbit polytope is the convex hull of an orbit under a finite group $G \leq \operatorname{GL}(d,\mathbb{R})$. We develop a general theory of possible affine symmetry groups of orbit polytopes. For every group, we define an open and dense…
Computing mixed volume of convex polytopes is an important problem in computational algebraic geometry. This paper establishes sufficient conditions under which the mixed volume of several convex polytopes exactly equals the normalized…
A theorem is proved concerning approximation of analytic functions by multivariate polynomials in the $s$-dimensional hypercube. The geometric convergence rate is determined not by the usual notion of degree of a multivariate polynomial,…
An extended formulation of a polytope is a linear description of this polytope using extra variables besides the variables in which the polytope is defined. The interest of extended formulations is due to the fact that many interesting…
Lattice polytope representation of natural numbers is introduced based on the fundamental theorem of arithmetic. The combinatorial and geometric properties of the polytopes are studied using Polymake and Qhull software. The volume of the…
We give compact extended formulations for the packing and partitioning orbitopes (with respect to the full symmetric group) described and analyzed in (Kaibel and Pfetsch, 2008). These polytopes are the convex hulls of all 0/1-matrices with…
We study the algebraic boundary of a convex semi-algebraic set via duality in convex and algebraic geometry. We generalize the correspondence of facets of a polytope to the vertices of the dual polytope to general semi-algebraic convex…
Factorizations over cones and their duals play central roles for many areas of mathematics and computer science. One of the reasons behind this is the ability to find a representation for various objects using a well-structured family of…
Let a $R$-body be a closed set, complement of union of open balls of radius $R$ in the Euclidean space. Properties generalizing similar ones for convex sets are proved for the family of $R$-bodies; properties for the family of sets…
Using the Newton polytope and polyhedron, we study analytic spread and ideal reductions of monomial ideals. We determine a bound for analytic spread based on halfspaces and hyperplanes of the Newton polytope, and we classify basic monomial…
It is shown that for non-hyperbolic real quadratic polynomials topological and quasisymmetric conjugacy classes are the same. By quasiconformal rigidity, each class has only one representative in the quadratic family, which proves that…
For a family of polytopes of even dimension $2p$, known as \textit{dual-neighborly}, it has been shown for $p\ne 2$ that the associated intersection of quadrics is a connected sum of sphere products $S^p\times S^p$. In this article we give…
In this paper we study the projective automorphism group of domains in real, complex, and quaternionic projective space and present two new characterizations of the unit ball in terms of the size of the automorphism group and the regularity…
We give a deterministic method of quasi-polynomial complexity to approximate the volume of the intersection of the unit hypercube with two specific sets. The method can actually be applied (without losing the quasi-polynomial complexity) to…
Even with the introduction of supercharacter theories, the representation theory of many unipotent groups remains mysterious. This paper constructs a family of supercharacter theories for normal pattern groups in a way that exhibit many of…
With the goal of obtaining strong relaxations for binary polynomial optimization problems, we introduce the pseudo-Boolean polytope defined as the convex hull of the set of binary points satisfying a collection of equations containing…
We consider the problem of computing the (two-sided) Hausdorff distance between the unit $\ell_{p_{1}}$ and $\ell_{p_{2}}$ norm balls in finite dimensional Euclidean space for $1 \leq p_1 < p_2 \leq \infty$, and derive a closed-form formula…
We establish estimates for the asymptotic best approximation of the Euclidean unit ball by polytopes under a notion of distance induced by the intrinsic volumes. We also introduce a notion of distance between convex bodies that is induced…