Related papers: Kippenhahn's construction revisited
Writing an uncomplicated, robust, and scalable three-dimensional convex hull algorithm is challenging and problematic. This includes, coplanar and collinear issues, numerical accuracy, performance, and complexity trade-offs. While there are…
It is well known that finite-dimensional polyhedral convex sets can be generated by finitely many points and finitely many directions. Representation formulas in this spirit are obtained for convex polyhedra and generalized convex polyhedra…
A simplified, user-friendly repackaging of the curvature estimates implied by the Seiberg-Witten equations is formulated in terms of the convex hull of the set of monopole classes. New results are also obtained concerning boundary cases of…
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…
This paper provides full \Matlab-code and informal correctness proofs for the lexicographic reverse search algorithm for convex hull calculations. The implementation was tested on a 1993 486-PC for various small and some larger, partially…
This paper presents a selected tour through the theory and applications of lifts of convex sets. A lift of a convex set is a higher-dimensional convex set that projects onto the original set. Many convex sets have lifts that are…
We introduce the notion of quadratic hull of a linear code, and give some of its properties. We then show that any symmetric bilinear multiplication algorithm for a finite-dimensional algebra over a field can be obtained by…
We derive a closed form description of the convex hull of mixed-integer bilinear covering set with bounds on the integer variables. This convex hull description is determined by considering some orthogonal disjunctive sets defined in a…
It is shown that a simple closed curve in $\mathbb C^n$ that is a uniform limit of rectifiable simple closed curves each of which has nontrivial polynomial hull has itself nontrivial polynomial hull. In case the limit curve is rectifiable,…
The integer hull of a polyhedron is the convex hull of the integer points contained in it. We show that the vertices of the integer hulls of a rational family of polyhedra of size O(n) have quasipolynomial coordinates. As a corollary, we…
We survey the Hilbert geometry of convex polytopes. In particular we present two important characterisations of these geometries, the first one in terms of the volume growth of their metric balls, the second one as a bi-lipschitz class of…
The paper presents an analog of the old result by the author and V. Voevodsky, according to which a Riemann surface admits a conformal structure, defined by an equilateral triangulation, if and only if the corresponding algebraic curve can…
The field of numerical algebraic geometry consists of algorithms for numerically solving systems of polynomial equations. When the system is exact, such as having rational coefficients, the solution set is well-defined. However, for a…
We report on experience with an investigation of the analytic structure of the solution of certain algebraic complex equations. In particular the behavior of their series expansions around the origin is discussed. The investigation imposes…
The connection between the commutativity of a family of $n\times n$ matrices and the generalized joint numerical ranges is studied. For instance, it is shown that ${\cal F}$ is a family of mutually commuting normal matrices if and only if…
Let $H$ be the Hilbert scheme of curves in complex projective $3$-space, with $d\geq 3$ and genus $g \leq (d-2)^2/4$. A complete, explicit description of the cone of curves and the ample cone of $H$ is given. From this, partial results on…
The infinite models in integer programming can be described as the convex hull of some points or as the intersection of halfspaces derived from valid functions. In this paper we study the relationships between these two descriptions. Our…
We introduce a notion of $k$-convexity and explore polygons in the plane that have this property. Polygons which are \mbox{$k$-convex} can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard…
The projective hull X^ of a subset X in complex projective space P^n is an analogue of the classical polynomial hull of a set in C^n. If X is contained in an affine chart C^n on P^n, then the affine part of X^ is the set of points x in C^n…
In this article, we are going to search for $n\times n$ matrices $A$ and $B$ such that their generalized numerical range $$W_A(B)=\{tr(AU^*BU) \ :\ U^*U=UU^*=I\}$$ is convex. More specifically, we consider $A=\hat{A}\oplus I_k$ and…