Related papers: Extended Formulations for Radial Cones
Deciding whether the union of two convex polyhedra is itself a convex polyhedron is a basic problem in polyhedral computations; having important applications in the field of constrained control and in the synthesis, analysis, verification…
We study the geometry of the set of closed extensions of index 0 of an elliptic cone operator and its model operator in connection with the spectra of the extensions, and give a necessary and sufficient condition for the existence of rays…
In the paper we consider convex cones in infinite-dimensional real vector spaces which are endowed with no topology. The main purpose is to study an internal geometric structure of convex cones and to obtain an analytical description of…
The article deals with operations defined on convex polyhedra or polyhedral convex functions. Given two convex polyhedra, operations like Minkowski sum, intersection and closed convex hull of the union are considered. Basic operations for…
This paper presents an additional class of regular polyhedra--envelope polyhedra--made of regular polygons, where the arrangement of polygons (creating a single surface) around each vertex is identical; but dihedral angles between faces…
Given a polygon $P$ in the plane, a {\em pop} operation is the reflection of a vertex with respect to the line through its adjacent vertices. We define a family of alternating polygons, and show that any polygon from this family cannot be…
Voronoi cells of a discrete set in Euclidean space are known as generalized polyhedra. We identify polyhedral cells of a discrete set through a direction cone. For an arbitrary set we distinguish polyhedral from non-polyhedral cells using…
We define a set of "enhanced" nilpotent quiver representations that generalizes the enhanced nilpotent cone. This set admits an action by an associated algebraic group $K$ with finitely many orbits. We define a combinatorial set that…
Very recently Richter and Rogers proved that any convex geometry can be represented by a family of convex polygons in the plane. We shall generalize their construction and obtain a wide variety of convex shapes for representing convex…
We introduce two explicit examples of polynomials orthogonal on the unit circle. Moments and the reflection coefficients are expressed in terms of Jacobi elliptic functions. We find explicit expression for these polynomials in terms of a…
Let a three-dimensional hyperbolic polyhedron $\mathcal P$ have finite volume $\mathrm{vol}(\mathcal P)$ and a finite number of vertices $\mathrm{ver}(\mathcal P)$. We call its normalized volume the quantity $\omega(\mathcal P) =…
We define a new family of valuations on polyhedral cones valued in the space of bounded polyhedra.
The bottom complex of a finite polyhedal pointed rational cone is the lattice polytopal complex of the compact faces of the convex hull of nonzero lattice points in the cone. The algebra, associated to the bottom complex of a cone, defines…
Answering a question posed by Joseph Malkevitch, we prove that there exists a polyhedral graph, with triangular faces, such that every realization of it as the graph of a convex polyhedron includes at least one face that is a scalene…
In this paper, we study the bilinear cone multiplier operator in two dimensions. We establish $L^{p_1}\times L^{p_2}\to L^{p}$ boundedness for a regularized version of this operator over a broad range of exponents satisfying the H\"older…
A formula for calculating Extensions of (mainly integral) Polynomial Functors is established, based upon projective resolutions. Sample computations are performed, which, in particular, exhibit a surprising non-trivial extension of Divided…
We consider the problem of determining the length of the shortest paths between points on the surfaces of tetrahedra and cubes. Our approach parallels the concept of Alexandrov's star unfolding but focuses on specific polyhedra and uses…
A beautiful result of Br\"ocker and Scheiderer on the stability index of basic closed semi-algebraic sets implies, as a very special case, that every $d$-dimensional polyhedron admits a representation as the set of solutions of at most…
Convex polyhedra are the basis for several abstractions used in static analysis and computer-aided verification of complex and sometimes mission critical systems. For such applications, the identification of an appropriate…
Let $\mathcal M=\langle M, <, +, \dots\rangle$ be an o-minimal expansion of an ordered group, and $P\subseteq M$ a dense set such that certain tameness conditions hold. We introduce the notion of a `product cone' in $\widetilde{\mathcal…