Related papers: Five-Full-Block Structured Singular Values of Real…
In this paper, we give the complete structures of the equivalence canonical form of four matrices over an arbitrary division ring. As applications, we derive some practical necessary and sufficient conditions for the solvability to some…
We consider discretizations of the hyper-singular integral operator on closed surfaces and show that the inverses of the corresponding system matrices can be approximated by blockwise low-rank matrices at an exponential rate in the block…
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. Under an ordering condition on the slopes of the functions at the origin, an algorithm that determines the optimum…
The completion of matrices with missing values under the rank constraint is a non-convex optimization problem. A popular convex relaxation is based on minimization of the nuclear norm (sum of singular values) of the matrix. For this…
The problem of diagonalizing a class of complicated matrices, to be called ultrametric matrices, is investigated. These matrices appear at various stages in the description of disordered systems with many equilibrium phases by the technique…
Given a nonnegative matrix M with rational entries, we consider two quantities: the usual positive semidefinite (psd) rank, where the matrix is factored through the cone of real symmetric psd matrices, and the rational-restricted psd rank,…
Economic and ecological models can be extremely complex, with a large number of agents/species each featuring multiple interacting dynamical quantities. In an attempt to understand the generic stability properties of such systems, we define…
The technique of semidefinite programming (SDP) relaxation can be used to obtain a nontrivial bound on the optimal value of a nonconvex quadratically constrained quadratic program (QCQP). We explore concave quadratic inequalities that hold…
A convex envelope for the problem of finding the best approximation to a given matrix with a prescribed rank is constructed. This convex envelope allows the usage of traditional optimization techniques when additional constraints are added…
The problem of determining $DS_n$, the complex numbers that occur as an eigenvalue of an $n$-by-$n$ doubly stochastic matrix, has been a target of study for some time. The Perfect-Mirsky region, $PM_n$, is contained in $DS_n$, and is known…
Let $A$ be an $n\times n$ random matrix with independent, identically distributed mean 0, variance 1 subgaussian entries. We prove that $$ \mathbb{P}(A\text{ has distinct singular values})\geq 1-e^{-cn} $$ for some $c>0$, confirming a…
We study the irreducible representations of simple algebraic groups in which some non-central semisimple element has at most one eigenvalue of multiplicity greater than 1. We bound the multiplicity of this eigenvalue in terms of the rank of…
We present an standard constraints generation algorithm to find an explicit set whose robustness is equal to the robustness of the feasible solution set of a combinatorial optimization problem with cost uncertainty. Computational experience…
We verify the Upper Bound Conjecture (UBC) for a class of odd-dimensional simplicial complexes that in particular includes all Eulerian simplicial complexes with isolated singularities. The proof relies on a new invariant of simplicial…
We explicitly construct and list all unitary superconformal multiplets, along with their index contributions, in five and six dimensions. From this data, we uncover various unifying themes in the representation theory of five- and…
We study $SO(m)$ covariant Matrix realizations of $ \sum_{i=1}^{m} X_i^2 = 1 $ for even $m$ as candidate fuzzy odd spheres following hep-th/0101001. As for the fuzzy four sphere, these Matrix algebras contain more degrees of freedom than…
Much work has been done to identify which binary codes can be represented by collections of open convex or closed convex sets. While not all binary codes can be realized by such sets, here we prove that every binary code can be realized by…
We investigate convexity properties of the set of eigenvalue tuples of $n\times n$ real symmetric matrices, whose all $k\times k$ (where $k\leq n$ is fixed) minors are positive semidefinite. It is proven that the set…
In this paper we study the real rank of monomials and we give an upper bound for the real rank of all monomials. We show that the real and the complex ranks of a monomial coincide if and only if the least exponent is equal to one.
We study the question of finding the maximal determinant of matrices of odd order with entries {-1,1}. The most general upper bound on the maximal determinant, due to Barba, can only be achieved when the order is the sum of two consecutive…