Related papers: Strong Shift Equivalence and Positive Doubly Stoch…

For a given reciprocal matrix A, we give a union of matrix intervals in which any consistent matrix obtained from an efficient vector for A lies, and, conversely, any consistent matrix in this union comes from an efficient vector for A. The…

Let $(M,d,\mu)$ be a uniformly discrete metric measure space satisfying space homogeneous volume doubling condition. We consider discrete time Markov chains on $M$ symmetric with respect to $\mu$ and whose one-step transition density is…

Every symbolic system supports a Borel measure that is invariant under the shift, but it is not known if every such systems supports a measure that is invariant under all of its automorphisms; known as a characteristic measure. We give…

Low-rank structure is a common implicit assumption in many modern reinforcement learning (RL) algorithms. For instance, reward-free and goal-conditioned RL methods often presume that the successor measure admits a low-rank representation.…

A sign pattern is a matrix that has entries from the set $\{+,-,0\}$. An $n\times n$ sign pattern $\mathcal{P}$ is called consistent if every real matrix in its qualitative class has exactly $k$ real eigenvalues and $n-k$ nonreal…

The aim of this note is to show that certain number theoretic inequalities due to Nesbitt and Shapiro have noncommutative counterparts involving positive definite matrices.

We study the class of Hankel matrices for which the $k\times k$-block-matrices are positive semi-definite. We prove that a $k\times k$-block-matrix has non zero determinant if and only if all $k\times k$-block matrices have non zero…

Applied to a nonnegative $m\times n$ matrix with a nonzero $\sigma$-diagonal, the sequence of matrices constructed by alternate row and column scaling conveges to a doubly stochastic matrix. It is proved that if this sequence converges…

A new class of sign-symmetric matrices is introduced in this paper. Such matrices are named J--sign-symmetric. The spectrum of a J--sign-symmetric irreducible matrix is studied under assumptions that its second compound matrix is also…

Nonnegative (linear) least square problems are a fundamental class of problems that is well-studied in statistical learning and for which solvers have been implemented in many of the standard programming languages used within the machine…

Let A,B be two square complex matrices of dimension at most 3. We show that the following conditions are equivalent i) There exists a finite subset U included in {2,3,4,...} such that for every positive integer t that is not in U,…

In this paper we give alternate proofs of some well-known matrix inequalities. In particular, we show that under certain conditions the inequality holds \begin{align}\sum \limits_{\lambda_i\in \mathrm{Spec}(ab^{T})}\mathrm{min}\{\log…

This article is dedicated to the following class of problems. Start with an $N\times N$ Hermitian matrix randomly picked from a matrix ensemble - the reference matrix. Applying a rank-$t$ perturbation to it, with $t$ taking the values $1\le…

Originating from spectral graph theory, cospectrality is a powerful generalization of exchange symmetry and can be applied to all real-valued symmetric matrices. Two vertices of an undirected graph with real edge weights are cospectral iff…

Two matrix vector spaces $V,W\subset \mathbb C^{n\times n}$ are said to be equivalent if $SVR=W$ for some nonsingular $S$ and $R$. These spaces are congruent if $R=S^T$. We prove that if all matrices in $V$ and $W$ are symmetric, or all…

We provide a countable set of conditions based on elementary symmetric polynomials that are necessary and sufficient for a trace class integral operator to be positive semidefinite, which is an important cornerstone for quantum theory in…

We prove the (generalized) principal pivot transform is matrix monotone, in the sense of the L\"owner ordering, under minimal hypotheses. This improves on the recent results of J. E. Pascoe and R. Tully-Doyle, Monotonicity of the principal…

Let $\mathbb{P}_G([0,\infty))$ and $\mathbb{P}_G^{'}([0,\infty))$ be the sets of positive semidefinite and positive definite matrices of order $n$, respectively, with nonnegative entries, where some positions of zero entries are restricted…

Let $\Gamma$ be a finite, undirected, connected, simple graph. We say that a matching $\mathcal{M}$ is a \textit{permutable $m$-matching} if $\mathcal{M}$ contains $m$ edges and the subgroup of $\text{Aut}(\Gamma)$ that fixes the matching…

We consider the numbers of positive and negative eigenvalues of matrices of squared distances between randomly sampled i.i.d. points in a given metric measure space. These numbers and their limits, as the number of points grows, in fact…