Related papers: Semidefinite geometry of the numerical range
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…
Universal algebraic geometry is generalised from solutions of equations in a single algebra to the study of $\varphi$- or $K$-spectra, akin to the prime spectrum of a ring. We explore their basic properties and constructions, give a…
Differential calculus on discrete sets is developed in the spirit of noncommutative geometry. Any differential algebra on a discrete set can be regarded as a `reduction' of the `universal differential algebra' and this allows a systematic…
Finite frames can be viewed as mass points distributed in $N$-dimensional Euclidean space. As such they form a subclass of a larger and rich class of probability measures that we call probabilistic frames. We derive the basic properties of…
Matrix geometric means between two positive definite matrices can be defined from distinct perspectives - as solutions to certain nonlinear systems of equations, as points along geodesics in Riemannian geometry, and as solutions to certain…
The 4-by-4 nilpotent matrices the numerical ranges of which have non-parallel flat portions on their boundary that are on lines equidistant from the origin are characterized. Their numerical ranges are always symmetric about a line through…
One dimensional metrical geometry may be developed in either an affine or projective setting over a general field using only algebraic ideas and quadratic forms. Some basic results of universal geometry are already present in this…
In order to understand the structure of the cohomologies involved in the study of projectively equivariant quantizations, we introduce a notion of affine representation of a Lie algebra.We show how it is related to linear representations…
We study the geometry and holonomy of semi-Riemannian, time-like metric cones that are indecomposable, i.e., which do not admit a local decomposition into a semi-Riemannian product. This includes irreducible cones, for which the holonomy…
We introduce an (equi-)affine invariant diffusion geometry by which surfaces that go through squeeze and shear transformations can still be properly analyzed. The definition of an affine invariant metric enables us to construct an invariant…
Researchers working with mathematical models are often confronted by the related problems of parameter estimation, model validation, and model selection. These are all optimization problems, well-known to be challenging due to…
Self-scaled barrier functions are fundamental objects in the theory of interior-point methods for linear optimization over symmetric cones, of which linear and semidefinite programming are special cases. We are classifying all self-scaled…
We study a class of parametrizations of convex cones of positive semidefinite matrices with prescribed zeros. Each such cone corresponds to a graph whose non-edges determine the prescribed zeros. Each parametrization in this class is a…
We define quasiconvex programming, a form of generalized linear programming in which one seeks the point minimizing the pointwise maximum of a collection of quasiconvex functions. We survey algorithms for solving quasiconvex programs either…
This article analyzes the geometric properties of an idempotent, non-associative algebraic structure that extends the Max-Times semiring. This algebraic structure is useful for studying systems of Max-Times and Max-Plus equations, employing…
Using the frame formalism we determine some possible metrics and metric-compatible connections on the noncommutative differential geometry of the real quantum plane. By definition a metric maps the tensor product of two 1-forms into a…
Kippenhahn discovered that the numerical range of a complex square matrix is the convex hull of a plane real algebraic curve. Here, we present an example of a convex set, which has a similar algebraic description as the numerical range,…
Convex rank tests are partitions of the symmetric group which have desirable geometric properties. The statistical tests defined by such partitions involve counting all permutations in the equivalence classes. Each class consists of the…
From descent theory to higher geometry, the idea of gluing has been embedded in many elegant and powerful techniques, proving instrumental for the solution of many problems. In this paper, we introduce a framework that allows to link…
We study bipartite maps on the plane with one infinite face and one face of perimeter 2. At first we consider the problem of their enumeration an then study the connection between the combinatorial structure of a map and the degree of its…