A graphical way to solve the Boolean matrix equations and
A graph-theoretic method for choosing a spanning set for a finite-dimensional vector space, with applications to the Grossman-Larson-Wright module and the Jacobian conjecture.
A Hadamard product involving inverse-positive matrices
In this paperwe study the Hadamard product of inverse-positive matrices.We observe that this class of matrices is not closed under the Hadamard product, but we show that for a particular sign pattern of the inverse-positive matrices A and B, the Hadamard product A ◦ B−1 is again an inverse-positive matrix.
A hierarchy in the family of real surjective functions
This expository paper focuses on the study of extreme surjective functions in ℝℝ. We present several different types of extreme surjectivity by providing examples and crucial properties. These examples help us to establish a hierarchy within the different classes of surjectivity we deal with. The classes presented here are: everywhere surjective functions, strongly everywhere surjective functions, κ-everywhere surjective functions, perfectly everywhere surjective functions and Jones functions. The...
A high-tech proof of the Mills-Robbins-Rumsey determinant formula.
A. Horn's result on matrices with prescribed singular values and eigenvalues.
A Jacobi Type Method for Complex Symmetric Matrices.
A Künneth Formula for the Cyclic Cohomology of Z/2-Graded Algebras.
A linear assignment formulation of the multiattribute decision problem
A linear programming based analysis of the CP-rank of completely positive matrices
A real matrix A is said to be completely positive (CP) if it can be decomposed as A = BB^T, where the real matrix B has exclusively non-negative entries. Let k be the rank of A and Φ_k the least possible number of columns of the matrix B, the so-called completely positive rank (cp-rank) of A. The present work is devoted to a study of a general upper bound for the cp-rank of an arbitrary completely positive matrix A and its dependence on the ordinary rank k. This general upper bound of the cp-rank...
A linearization of Connes' embedding problem.
A local form for the automorphisms of the spectral unit ball.
A Local-Global Principle for Quadric Forms.
A lower bound sequence for the minimum eigenvalue of Hadamard product of an -matrix and its inverse
We propose a lower bound sequence for the minimum eigenvalue of Hadamard product of an -matrix and its inverse, in terms of an -type eigenvalues inclusion set and inequality scaling techniques. In addition, it is proved that the lower bound sequence converges. Several numerical experiments are given to demonstrate that the lower bound sequence is sharper than some existing ones in most cases.
A Markov approach to the generalized Syracuse algorithm
A matrix constructive method for the analytic-numerical solution of coupled partial differential systems
In this paper we construct analytic-numerical solutions for initial-boundary value systems related to the equation , where is an arbitrary square complex matrix and ia s matrix such that the real part of the eigenvalues of the matrix is positive. Given an admissible error and a finite domain , and analytic-numerical solution whose error is uniformly upper bounded by in , is constructed.
A matrix derivation of a representation theorem for (tr Ap)1/p.
A matrix derivation of a well-known representation theorem for (tr Ap)1/p is given, which is the solution of a restricted maximization problem. The paper further gives a solution of the corresponding restricted minimization problem.
A matrix function useful in the estimation of linear continuous-time models.
A matrix inequality
A matrix inequality for Möbius functions.