Related papers: Kippenhahn's construction revisited
The real number system is geometrically extended to include three new anticommuting square roots of plus one, each such root representing the direction of a unit vector along the orthonormal coordinate axes of Euclidean 3-space. The…
In this paper we present several results on the expected complexity of a convex hull of $n$ points chosen uniformly and independently from a convex shape. (i) We show that the expected number of vertices of the convex hull of $n$ points,…
Let $C$ be a generic complex plane plane curve with a given Newton polygon $P$. We compute the number of its inflection points and bitangents (equivalently, the number of singularities of the projectively dual curve $C^\vee$). We also prove…
In this paper, we study the mixed-integer nonlinear set given by a separable quadratic constraint on continuous variables, where each continuous variable is controlled by an additional indicator. This set occurs pervasively in optimization…
Why is it that after so many years matrices continue to play such an important roll in Physics and mathematics? Is there a geometric way of looking at matrices, and linear transformations in general, that lies at the roots of their success?…
Generalized polyhedral convex sets, generalized polyhedral convex functions on locally convex Hausdorff topological vector spaces, and the related constructions such as sum of sets, sum of functions, directional derivative, infimal…
The Kauffman bracket skein algebra of a surface is a generalization of the Jones polynomial invariant for links and plays a principal role in the Witten-Reshetikhin- Turaev topological quantum field theory. However, the multiplicative…
The aim of this paper is to describe the closure of the numerical range of the product of two orthogonal projections in Hilbert space as a closed convex hull of some explicit ellipses parametrized by points in the spectrum. Several…
We obtain local and global results on polynomially convex hulls of Lagrangian and totally real submanifolds of $C^n$ with self-intersections and open Whitney umbrella points.
Suppose that c is an operator on a Hilbert Space H such that the von Neumann algebra N generated by c is finite. Suppose that tau is a faithful normal tracial state on N. Let B denote the spectal scale of c with respect to tau. We show that…
This paper studies geometric properties of the Iterated Matrix Multiplication polynomial and the hypersurface that it defines. We focus on geometric aspects that may be relevant for complexity theory such as the symmetry group of the…
We obtain a formula for the number of genus one curves with a fixed complex structure of a given degree on a del-Pezzo surface that pass through an appropriate number of generic points of the surface. This enumerative problem is expressed…
Finite convex geometries are combinatorial structures. It follows from a recent result of M.\ Richter and L.G.\ Rogers that there is an infinite set $T_{rr}$ of planar convex polygons such that $T_{rr}$ with respect to geometric convex…
In this paper, an effective method with time complexity of $\mathcal{O}(K^{3/2}N^2\log \frac{K}{\epsilon_0})$ is introduced to find an approximation of the convex hull for $N$ points in dimension $n$, where $K$ is close to the number of…
In pure integer linear programming it is often desirable to work with polyhedra that are full-dimensional, and it is well known that it is possible to reduce any polyhedron to a full-dimensional one in polynomial time. More precisely, using…
A convex polygon is defined as a sequence (V_0,...,V_{n-1}) of points on a plane such that the union of the edges [V_0,V_1],..., [V_{n-2},V_{n-1}], [V_{n-1},V_0] coincides with the boundary of the convex hull of the set of vertices…
We prove in this paper that the Hilbert geometry associated with an open convex polygonal set is Lipschitz equivalent to Euclidean plane.
We explore the differential geometry of finite sets where the differential structure is given by a quiver rather than as more usual by a graph. In the finite group case we show that the data for such a differential calculus is described by…
The simplest way to generate a lattice of convex sets is to consider an initial set of points and draw segments, triangles, and any convex hull from it, then intersect them to obtain new points, and so forth. The result is an infinite…
We study the geometry of the algebraic set of tuples of composable matrices which multiply to a fixed matrix, using tools from the theory of quiver representations. In particular, we determine its codimension $C$ and the number $\theta$ of…