Related papers: Doubly stochastic arrays with small support

We give a useful new characterization of the set of all completely positive, trace-preserving (i.e., stochastic) maps from 2x2 matrices to 2x2 matrices. These conditions allow one to easily check any trace-preserving map for complete…

A matrix is given in ``shredded'' form if we are presented with the multiset of rows and the multiset of columns, but not told which row is which or which column is which. The matrix is reconstructible if it is uniquely determined by this…

Let S=(s_1,s_2,..., s_m) and T = (t_1,t_2,..., t_n) be vectors of non-negative integers with sum_{i=1}^{m} s_i = sum_{j=1}^n t_j. Let B(S,T) be the number of m*n matrices over {0,1} with j-th row sum equal to s_j for 1 <= j <= m and k-th…

We study stable subspaces of positive extremal maps of finite dimensional matrix algebras that preserve trace and matrix identity (so-called bistochastic maps). We have established the existence of the isometric-sweeping decomposition for…

We consider the convex set $\Gamma_{m,n}$ of $m\times n$ stochastic matrices and the convex set $\Gamma_{m,n}^\pi\subset \Gamma_{m,n}$ of $m\times n$ centrosymmetric stochastic matrices (stochastic matrices that are symmetric under rotation…

In this paper a new graph invariant based on the minimal hitting set problem is introduced. It is shown that it represents a tight lower bound for the doubly metric dimension of a graph. Exact values of new invariant for paths, stars,…

A bistochastic matrix is a square matrix with positive entries such that rows and columns sum to unity. A unistochastic matrix is a bistochastic matrix whose matrix elements are the absolute values squared of a unitary matrix. We can now…

In this note, we consider matrices similar to $X$-form matrices, which are the matrices for which only the diagonal and the anti-diagonal elements can be different from zero. First, we give a characterization of these matrices using the…

We call an n-tuple Q_1, ..., Q_n of positive definite nxn matrices alpha-conditioned for some alpha > 1 if the ratio of the largest among the eigenvalues of Q_1, ..., Q_n to the smallest among the eigenvalues of Q_1, ..., Q_n does not…

A set of nonnegative matrices $\mathcal{M}=\{M_1, M_2, \ldots, M_k\}$ is called primitive if there exist indices $i_1, i_2, \ldots, i_m$ such that $M_{i_1} M_{i_2} \ldots M_{i_m}$ is positive (i.e. has all its entries $>0$). The length of…

Let \Gamma be the convex set consisting of all marginal tracial states on the tensor product B \otimes B of the algebra B of nxn matrices over the complex numbers. We find necessary and sufficient conditions for such a state to be extremal…

We use probabilistic methods to find lower bounds on the maximum number, in a graph with domination number \gamma, of dominating sets of size \gamma. We find that we can randomly generate a graph that, w.h.p., is dominated by almost all…

We prove a conjecture about the minimal nonnegative solutions of algebraic Riccati equations associated with reducible singular M-matrices. The result enhances our understanding of the behaviour of doubling algorithms for finding the…

This article considers stochastic algorithms for efficiently solving a class of large scale non-linear least squares (NLS) problems which frequently arise in applications. We propose eight variants of a practical randomized algorithm where…

We initiate a study of the zero-nonzero patterns of n by n alternating sign matrices. We characterize the row (column) sum vectors of these patterns and determine their minimum term rank. In the case of connected alternating sign matrices,…

We derive approximation algorithms for the nonnegative matrix factorization problem, i.e. the problem of factorizing a matrix as the product of two matrices with nonnegative coefficients. We form convex approximations of this problem which…

A method based on multicanonical Monte Carlo is applied to the calculation of large deviations in the largest eigenvalue of random matrices. The method is successfully tested with the Gaussian orthogonal ensemble (GOE), sparse random…

In this paper, we investigate the conditions under which a diagonal quadratic form $\sum_{i=1}^{m}a_i X_i^2$ represents every $n \times n$ integral matrix, where $a_i$ ($1 \leq i \leq m$) are integers. For $n=2$, we give a necessary and…

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.…

A nonnegative matrix $A$ is said to be {\it primitive} if for some positive integer $m$, entries in $A^m$ are positive, notationally represented as $A^m>0.$ The smallest such $m$ is called the {\it exponent} of $A$, denoted $exp(A).$ For…