相关论文: Sufficient conditions for total positivity, compou…

This work focuses on the problem of exact model reduction of positive linear systems, by leveraging minimal realization theory. While determining the existence of a positive reachable realization remains in general an open problem, we are…

We consider the lower-triangular matrix of generating polynomials that enumerate $k$-component forests of rooted trees on the vertex set $[n]$ according to the number of improper edges (generalizations of the Ramanujan polynomials). We show…

We study the problem of when a periodic square matrix of order $n$ over an arbitrary field $\mathbb{F}$ is decomposable into the sum of a square-zero matrix and a torsion matrix, and show that this decomposition can always be obtained for…

One of the main concepts in quantum physics is a density matrix, which is a symmetric positive definite matrix of trace one. Finite probability distributions are a special case where the density matrix is restricted to be diagonal. Density…

In order to compute the Schmidt decomposition of $A\in M_k\otimes M_m$, we must consider an associated self-adjoint map. Here, we show that if $A$ is positive under partial transposition (PPT) or symmetric with positive coefficients (SPC)…

We give a complete characterization of nonnegative integers $j$ and $k$ and a positive integer $n$ for which there is an $n$-by-$n$ matrix with its power partial isometry index equal to $j$ and its ascent equal to $k$. Recall that the power…

A linear dynamical system is called positive if its flow maps the non-negative orthant to itself. More precisely, it maps the set of vectors with zero sign variations to itself. A linear dynamical system is called $k$-positive if its flow…

We study the properties of elections that have a given position matrix (in such elections each candidate is ranked on each position by a number of voters specified in the matrix). We show that counting elections that generate a given…

An oriented graph is said positively multiplicative when its adjacency matrix $A$ embeds in a matrix algebra admitting a basis $\mathsf{B}$ with nonnegative structure constants in which the matrix of the multiplication by $A$ coincides with…

We consider nonnegative r-potent matrices with finite dimensions and study their decomposability. We derive the precise conditions under which an r-potent matrix is decomposable. We further determine a general structure for the r-potent…

Let G be a connected reductive group over the complex numbers with a fixed pinning. We define and study the totally positive part of the set of maximal tori of G.

A square matrix of order n with $n\geq 2$ is called permutative matrix when all its rows (up to the frst one) are permutations of precisely its frst row. In this paper recalling spectral results for partitioned into $2$-by-$2$ symmetric…

In this paper, we study the positive stability of $P$-matrices. We prove that a $P$-matrix A is positively stable if A is a $Q^2$-matrix and there is at least one nested sequence of principal submatrices of A each of which is also a…

A generalization of the Vandermonde matrices which arise when the power basis is replaced by the Said-Ball basis is considered. When the nodes are inside the interval (0,1), then those matrices are strictly totally positive. An algorithm…

Total positivity of matrices is deeply studied and plays an important role in various branches of mathematics. The main purpose of this paper is to study total positivity of a matrix $M=[M_{n,k}]_{n,k}$ generated by the weighted lattice…

We investigate the fundamental conditions on the sampling pattern, i.e., locations of the sampled entries, for finite completability of a low-rank tensor given some components of its Tucker rank. In order to find the deterministic necessary…

We will consider completely positive maps defined on tensor products of von Neumann algebras and taking values in the algebra of bounded operators on a Hilbert space and particularly certain convex subsets of the set of such maps. We show…

This paper proposes an efficient algorithm for testing copositivity of homogeneous polynomials over the positive semidefinite cone. The algorithm is based on a novel matrix optimization reformulation and requires solving a hierarchy of…

Low-rank matrix completion (LRMC) problems arise in a wide variety of applications. Previous theory mainly provides conditions for completion under missing-at-random samplings. This paper studies deterministic conditions for completion. An…

To a sequence (s_n)_{n\ge 0} of real numbers we associate the sequence of Hankel matrices \mathcal H_n=(s_{i+j}),0\le i,j \le n. We prove that if the corresponding sequence of Hankel determinants D_n=\det\mathcal H_n satisfy D_n>0 for n<n_0…