Related papers: Examples for the Quantum Kippenhahn Theorem
The Lichtenbaum-Quillen conjecture for smooth complex varieties states that algebraic and topological K-theory with finite coefficients become isomorphic in high degrees. We define the "Lichtenbaum-Quillen dimension" of a variety in terms…
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…
We introduce a notion of singular hermitian metrics (s.h.m.) for holomorphic vector bundles and define positivity in view of $L^2$-estimates. Associated with a suitably positive s.h.m. there is a (coherent) sheaf 0-th kernel of a certain…
Many practical problems need the output of a machine learning model to satisfy a set of constraints, $K$. Nevertheless, there is no known guarantee that classical neural network architectures can exactly encode constraints while…
A spectrahedron is the feasible set of a semidefinite program, SDP, i.e., the intersection of an affine set with the positive semidefinite cone. While strict feasibility is a generic property for random problems, there are many classes of…
A framework for estimation and hypothesis testing of functional restrictions against general alternatives is proposed. The parameter space is a reproducing kernel Hilbert space (RKHS). The null hypothesis does not necessarily define a…
This paper presents a novel symbolic analytic framework to address the Hodge Conjecture, utilizing a refined invariant called the Hermitian spectral fingerprint. We modify the fingerprint functional to specifically exclude $(k,k)$…
The quadratic programming over one inequality quadratic constraint (QP1QC) is a very special case of quadratically constrained quadratic programming (QCQP) and attracted much attention since early 1990's. It is now understood that, under…
Given the projections of two semialgebraic sets defined by polynomial matrix inequalities, it is in general difficult to determine whether one is contained in the other. To address this issue we propose a new matrix Positivstellensatz that…
Kleene algebra (KA) is an important tool for reasoning about general program equivalences, with a decidable and complete equational theory. However, KA cannot always prove equivalences between specific programs. For this purpose, one adds…
Convex regression is the problem of fitting a convex function to a data set consisting of input-output pairs. We present a new approach to this problem called spectrahedral regression, in which we fit a spectrahedral function to the data,…
In this paper we consider the problem of unambiguous discrimination between a set of linearly independent pure quantum states. We show that the design of the optimal measurement that minimizes the probability of an inconclusive result can…
We describe several algorithms for matrix completion and matrix approximation when only some of its entries are known. The approximation constraint can be any whose approximated solution is known for the full matrix. For low rank…
We consider a matrix pencil whose coefficients depend on a positive parameter $\epsilon$, and have asymptotic equivalents of the form $a\epsilon^A$ when $\epsilon$ goes to zero, where the leading coefficient $a$ is complex, and the leading…
This paper is a tutorial in a general and explicit procedure to simplify semidefinite programs which are invariant under the action of a symmetry group. The procedure is based on basic notions of representation theory of finite groups. As…
Linearly repetitive cut and project sets are mathematical models for perfectly ordered quasicrystals. In a previous paper we presented a characterization of linearly repetitive cut and project sets. In this paper we extend the classical…
In this paper, we first show that the Jacobian Conjecture is true for non-homogeneous power linear mappings under some conditions. Secondly, we prove an equivalent statement about the Jacobian Conjecture in dimension $r\geq 1$ and give some…
We study the hermitian one matrix model with semi-classical potential. This is a general unitary invariant random matrix ensemble in which the potential has a derivative that is a rational function and the measure is supported on some…
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,…
We study the structure of the set of algebraic curvature operators satisfying a sectional curvature bound under the light of the emerging field of Convex Algebraic Geometry. More precisely, we determine in which dimensions $n$ this convex…