Related papers: A "hidden" characterization of polyhedral convex s…

Let $K\subseteq{\mathbb R}^n$ be a convex semialgebraic set. The semidefinite extension degree ${\mathrm{sxdeg}}(K)$ of $K$ is the smallest number $d$ such that $K$ is a linear image of an intersection of finitely many spectrahedra, each of…

A convex polyhedron, that is, a compact convex subset of $\mathbb{R}^3$ which is the intersection of finitely many closed half-spaces, can be rectified by taking the convex hull of the midpoints of the edges of the polyhedron. We derive…

We reinterpret an inequality, due originally to Sidorenko, for linear extensions of posets in terms of convex subsets of the symmetric group $\mathfrak{S}_n$. We conjecture that the analogous inequalities hold in arbitrary…

Let $A$ be a unital separable simple $C^*$-algebra with tracial rank zero and let $x, \, y\in A$ be two normal elements. We show that $x$ is in the closure of the convex full of the unitary obit of $y$ if and only if there exists a sequence…

A set is star-shaped if there is a point in the set that can see every other point in the set in the sense that the line-segment connecting the points lies within the set. We show that testing whether a non-empty compact smooth region is…

A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…

We say that a subset of C^n is hypoconvex if its complement is the union of complex hyperplanes. Let D be the closed unit disk in C, T the unit circle. We prove two conjectures of Helton and Marshall. (See ``Frequency domain design and…

The standard convex closed hull of a set is defined as the intersection of all images, under the action of a group of rigid motions, of a half-space containing the given set. In this paper we propose a generalisation of this classical…

A pseudo-edge graph of a convex polyhedron K is a 3-connected embedded graph in K whose vertices coincide with those of K, whose edges are distance minimizing geodesics, and whose faces are convex. We construct a convex polyhedron K in…

We study two notions. One is that of spindle convexity. A set of circumradius not greater than one is spindle convex if, for any pair of its points, it contains every short circular arc of radius at least one, connecting them. The other…

We demonstrate that the set $L^\infty(X, [-1,1])$ of all measurable functions over a Borel measure space $(X, \mathcal B, \mu )$ with values in the unit interval is typically non-polyhedric when interpreted as a subset of a dual space. Our…

Let $K$ be a compact subset of a totally-real manifold $M$, where $M$ is either a $\mathcal{C}^2$-smooth graph in $\mathbb{C}^{2n}$ over $\mathbb{C}^n$, or $M=u^{-1}\{0\}$ for a $\mathcal{C}^2$-smooth submersion $u$ from $\mathbb{C}^n$ to…

Every polygon $P$ can be companioned by a cap polygon $\hat P$ such that $P$ and $\hat P$ serve as two parts of the boundary surface of a polyhedron $V$. Pairs of vertices on $P$ and $\hat P$ are identified successively to become vertices…

Given a combinatorial description $C$ of a polyhedron having $E$ edges, the space of dihedral angles of all compact hyperbolic polyhedra that realize $C$ is generally not a convex subset of $\mathbb{R}^E$ \cite{DIAZ}. If $C$ has five or…

A cubic polyhedron is a polyhedral surface whose edges are exactly all the edges of the cubic lattice. Every such polyhedron is a discrete minimal surface, and it appears that many (but not all) of them can be relaxed to smooth minimal…

Let C be a real nonsingular affine curve of genus one, embedded in affine n-space, whose set of real points is compact. For any polynomial f which is nonnegative on C(R), we prove that there exist polynomials f_i with f \equiv \sum_i f_i^2…

This work provides two sufficient conditions in terms of sections or projections for a convex body to be a polytope. These conditions are necessary as well.

Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent the whole set of solutions of complex linear constraints…

We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the…

We prove the arborescence of any locally finite complex that is $CAT(0)$ with a polyhedral metric for which all vertex stars are convex. In particular locally finite $CAT(0)$ cube complexes or equilateral simplicial complexes are…