Related papers: Five-Full-Block Structured Singular Values of Real…
A set is called semidefinite representable or semidefinite programming (SDP) representable if it can be represented as the projection of a higher dimensional set which is represented by some Linear Matrix Inequality (LMI). This paper…
The affine inverse eigenvalue problem consists of identifying a real symmetric matrix with a prescribed set of eigenvalues in an affine space. Due to its ubiquity in applications, various instances of the problem have been widely studied in…
The following numerical control over the topological equivalence is proved: two complex polynomials in $n\not= 3$ variables and with isolated singularities are topologically equivalent if one deforms into the other by a continuous family of…
Quadratically constrained quadratic programs (QCQPs) are a fundamental class of optimization problems well-known to be NP-hard in general. In this paper we study sufficient conditions for a convex hull result that immediately implies that…
We propose to consider a mutual incidence matrix $M$ of two balanced incomplete block designs built on the same finite set. In the simplest case, this matrix reduces to the standard incidence matrix of one block design. We find all…
We are interested in the phenomenon of the essential spectrum instability for a class of unbounded (block) Jacobi matrices. We give a series of sufficient conditions for the matrices from certain classes to have a discrete spectrum on a…
We construct rational models for classifying spaces of self-equivalences of bundles over simply connected finite CW-complexes relative to a given simply connected subcomplex. Via work of Berglund-Madsen and Krannich this specializes to…
We present a necessary and sufficient condition for a 3 by 3 matrix to be unitarily equivalent to a symmetric matrix with complex entries, and an algorithm whereby an arbitrary 3 by 3 matrix can be tested. This test generalizes to a…
This paper deals with the numerical computation of the least singular value of a rectangular matrix $A$ relative to a pair of closed convex cones $(P,Q)$, which is defined as the optimal value of the non-convex optimization problem of…
In this paper, we characterize the closures of convex hulls of unitary orbits of self-adjoint operators in unital, separable, simple C$^*$-algebras with non-trivial tracial simplex, real rank zero, stable rank one, and strict comparison of…
We construct a skew-Hadamard matrix of order 1252 = 2(5^4 + 1) using a bordered skew-Hadamard difference family over GF(5^4), with blocks given as unions of cyclotomic classes of order N = 16. This order has been reported as missing in some…
In the paper, a simple condition guaranteing the finiteness property for a bounded set of matrices is presented. Given a bounded set S of real or complex matrices, it is shown that existence of a sequence of matrix products such that the…
We prove the existence of complexified real arrangements with the same combinatorics but different embeddings in the complex projective plane. Such pair of arrangements has an additional property: they admit conjugated equations on the ring…
This paper considers matrix convex sets invariant under several types of rotations. It is known that matrix convex sets that are free semialgebraic are solution sets of Linear Matrix Inequalities (LMIs); they are called free spectrahedra.…
We consider the problem of robust matrix completion, which aims to recover a low rank matrix $L_*$ and a sparse matrix $S_*$ from incomplete observations of their sum $M=L_*+S_*\in\mathbb{R}^{m\times n}$. Algorithmically, the robust matrix…
Superregular matrices, i.e., matrices where all square submatrices are non-singular, have a wide range of applications in communications. A superregular block matrix is a broader concept where all full block submatrices, with the…
We study the polyhedral convex hull structure of a mixed-integer set which arises in a class of cardinality-constrained concave submodular minimization problems. This class of problems has an objective function in the form of $f(a^\top x)$,…
A matrix convex set is a set of the form $\mathcal{S} = \cup_{n\geq 1}\mathcal{S}_n$ (where each $\mathcal{S}_n$ is a set of $d$-tuples of $n \times n$ matrices) that is invariant under UCP maps from $M_n$ to $M_k$ and under formation of…
We develop several methods, based on the geometric relationship between the eigenspaces of a matrix and its adjoint, for determining whether a square matrix having distinct eigenvalues is unitarily equivalent to a complex symmetric matrix.…
Quadratic systems of equations appear in several applications. The results in this paper are motivated by quadratic systems of equations that describe equilibrium behavior of physical infrastructure networks like the power and gas grids.…