Related papers: Canonical forms, higher rank numerical range, conv…
In this paper, we study the symmetric rank of products of linear forms and an irreducible quadratic form. The main result presents a new, non-trivial lower bound for the rank, and the arguments rely on the apolarity lemma. In the special…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
We study dual volume representations of canonical forms for positive geometries in projective spaces, expressing their rational canonical functions as Laplace transforms of measures supported on the convex dual of the semialgebraic set.…
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…
The existing matrix completion methods focus on optimizing the relaxation of rank function such as nuclear norm, Schatten-p norm, etc. They usually need many iterations to converge. Moreover, only the low-rank property of matrices is…
The matrix of canonical differential equations consists of the 1-$\mathrm{d}\log$-form coefficients obtained by projecting ($n$+1)-$\mathrm{d}\log$-forms onto $n$-$\mathrm{d}\log$-form master integrands. With dual form in relative…
We generalise the Elliptical Range Theorem to characterise the numerical range of matrices belonging to a subspace of the space of \(3 \times 3\) matrices. Using Specht's Theorem, which characterizes when two matrices are unitarily…
In this paper, we study the rank of matrices of bicomplex numbers. The relationship between rank, idempotent column rank and idempotent row rank is examined. Then, the solution of a system of equations in bicomplex space is presented using…
Motivated by recent works on statistics of matrices over sets of number theoretic interest, we study matrices with entries from arbitrary finite subsets $\mathcal A$ of finite rank multiplicative groups infields of characteristic zero. We…
This paper deals with the problem of robust matrix completion -- retrieving a low-rank matrix and a sparse matrix from the compressed counterpart of their superposition. Though seemingly not an unresolved issue, we point out that the…
A canonical system of basic invariants is a system of invariants satisfying a set of differential equations. The properties of a canonical system are related to the mean value property for polytopes. In this article, we naturally identify…
A matrix completion problem is to recover the missing entries in a partially observed matrix. Most of the existing matrix completion methods assume a low rank structure of the underlying complete matrix. In this paper, we introduce an…
We propose a new shape-based modeling technique for applications in imaging problems. Given a collection of shape priors (a shape dictionary), we define our problem as choosing the right dictionary elements and geometrically composing them…
Canonical quantization may be approached from several different starting points. The usual approaches involve promotion of c-numbers to q-numbers, or path integral constructs, each of which generally succeeds only in Cartesian coordinates.…
We extend the proof in [M.~Crouzeix and C.~Palencia, {\em The numerical range is a $(1 + \sqrt{2})$-spectral set}, SIAM Jour.~Matrix Anal.~Appl., 38 (2017), pp.~649-655] to show that other regions in the complex plane are $K$-spectral sets.…
On conformally compact manifolds of arbitrary signature, we use conformal geometry to identify a natural (and very general) class of canonical boundary problems. It turns out that these encompass and extend aspects of already known…
Given a known matrix that is the sum of a low rank matrix and a masked sparse matrix, we wish to recover both the low rank component and the sparse component. The sparse matrix is masked in the sense that a linear transformation has been…
We study containment and uniqueness problems concerning matrix convex sets. First, to what extent is a matrix convex set determined by its first level? Our results in this direction quantify the disparity between two product operations,…
We establish a sharp upper estimate for the order of a canonical system in terms of the Hamiltonian. This upper estimate becomes an equality in the case of Krein strings. As an application we prove a conjecture of Valent about the order of…
The problem of minimizing a (nonconvex) quadratic form over the unit simplex, referred to as a standard quadratic program, admits an exact convex conic formulation over the computationally intractable cone of completely positive matrices.…