English
Related papers

Related papers: Extended Formulations for Radial Cones

200 papers

We give explicit polynomial-sized (in $n$ and $k$) semidefinite representations of the hyperbolicity cones associated with the elementary symmetric polynomials of degree $k$ in $n$ variables. These convex cones form a family of…

Optimization and Control · Mathematics 2016-11-17 James Saunderson , Pablo A. Parrilo

By interpreting planar polynomial curves as complex-valued functions of a real parameter, an inner product, norm, metric function, and the notion of orthogonality may be defined for such curves. This approach is applied to the complex…

Numerical Analysis · Mathematics 2024-02-16 Rida T. Farouki , Marjeta Knez , Vito Vitrih , Emil Žagar

In a previous work we proved that each $n$-dimensional convex polyhedron ${\mathcal K}subset{\mathbb R}^n$ and its relative interior are regular images of ${\mathbb R}^n$. As the image of a non-constant polynomial map is an unbounded…

Algebraic Geometry · Mathematics 2024-01-24 José F. Fernando , J. M. Gamboa , Carlos Ueno

Let $X$ be a complex manifold and let $g$ be a polyhedral metric on it inducing its topology. We say that $g$ is a polyhedral K\"ahler (PK) metric on $X$ if it is K\"ahler outside its singular set. The local geometry of PK metrics is…

Differential Geometry · Mathematics 2021-06-25 Martin de Borbon , Dmitri Panov

We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the increase of their distances. Its…

Combinatorics · Mathematics 2015-09-22 Guenter Rote , Francisco Santos , Ileana Streinu

An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). It is a long unsolved problem to determine whether every polyhedron…

Computational Geometry · Computer Science 2007-05-23 Mirela Damian , Robin Flatland , Joseph O'Rourke

We develop techniques to construct a series of sparse polyhedral approximations of the semidefinite cone. Motivated by the semidefinite (SD) bases proposed by Tanaka and Yoshise (2018), we propose a simple expansion of SD bases so as to…

Optimization and Control · Mathematics 2021-06-01 Yuzhu Wang , Akihiro Tanaka , Akiko Yoshise

Compact polyhedra of cubic point symmetry Oh, exhibit surfaces of planar sections (facets) characterized by normal vector families {abc} with up to 48 members each, compatible with Oh symmetry. We focus first on polyhedra confined by facets…

Atomic and Molecular Clusters · Physics 2022-09-20 KLaus E. Hermann

For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a…

Combinatorics · Mathematics 2007-05-23 David Orden , Francisco Santos

This paper concerns the question whether the cone spectral radius of a continuous compact order-preserving homogenous map on a closed cone in Banach space depends continuously on the map. Using the fixed point index we show that if there…

Functional Analysis · Mathematics 2011-11-15 Bas Lemmens , Roger Nussbaum

We investigate a novel setting for polytope rigidity, where a flex must preserve edge lengths and the planarity of faces, but is allowed to change the shapes of faces. For instance, the regular cube is flexible in this notion. We present…

Combinatorics · Mathematics 2026-03-11 Matthias Himmelmann , Bernd Schulze , Martin Winter

The shape of crystalline nanoparticles (NP) can often be described by polyhedra with flat facet surfaces. Thus, structural studies of polyhedral bodies can help to describe geometric details of NPs. Here we consider compact polyhedra of…

Mesoscale and Nanoscale Physics · Physics 2023-07-24 Klaus E. Hermann

A polyiamond is a polygon composed of unit equilateral triangles, and a generalized deltahedron is a convex polyhedron whose every face is a convex polyiamond. We study a variant where one face may be an exception. For a convex polygon P,…

Given a set of radii measured from a fixed point, the existence of a convex configuration with respect to the set of distinct radii in the two-dimensional case is proved when radii are distinct or repeated at most four points. However, we…

Computational Geometry · Computer Science 2025-08-22 Supanut Chaidee , Kokichi Sugihara

A convex polyhedron is Rupert if a hole can be cut into it (making its genus $1$) such that an identical copy of the polyhedron can pass through the hole. Resolving a conjecture of Jerrard-Wetzel-Yuan, Steininger and Yurkevich recently…

Metric Geometry · Mathematics 2026-04-30 Tony Zeng

Let $D$ be the set of $n\times n$ positive semidefinite matrices of trace equal to one, also known as the set of density matrices. We prove two results on the hardness of approximating $D$ with polytopes. First, we show that if $0 <…

Optimization and Control · Mathematics 2022-06-14 Hamza Fawzi

A convex cone is said to be projectionally exposed (p-exposed) if every face arises as a projection of the original cone. It is known that, in dimension at most four, the intersection of two p-exposed cones is again p-exposed. In this paper…

Optimization and Control · Mathematics 2025-01-23 Bruno F. Lourenço , Vera Roshchina , James Saunderson

A convex polytope $P$ in the real projective space with reflections in the facets of $P$ is a Coxeter polytope if the reflections generate a subgroup $\Gamma$ of the group of projective transformations so that the $\Gamma$-translates of the…

Geometric Topology · Mathematics 2022-07-14 Suhyoung Choi , Gye-Seon Lee , Ludovic Marquis

We describe the adjacency of vertices of the (unbounded version of the) set covering polyhedron, in a similar way to the description given by Chvatal for the stable set polytope. We find a sufficient condition for adjacency, and…

Combinatorics · Mathematics 2017-10-10 Néstor E. Aguilera , Ricardo D. Katz , Paola B. Tolomei

This paper gives a partial confirmation of a conjecture of P. Agarwal, S. Har-Peled, M. Sharir, and K. Varadarajan that the total curvature of a shortest path on the boundary of a convex polyhedron in the 3-dimensional Euclidean space…

Metric Geometry · Mathematics 2007-05-23 Imre Barany , Krystyna Kuperberg , Tudor Zamfirescu