相关论文: Nonnegative minors of minor matrices
To a given nonsingular triangular matrix A with entries from a ring, we associate a weighted bipartite graph G(A) and give a combinatorial description of the inverse of A by employing paths in G(A). Under a certain condition, nonsingular…
A $k$-positive matrix is a matrix where all minors of order $k$ or less are positive. Computing all such minors to test for $k$-positivity is inefficient, as there are $\sum_{\ell=1}^k \binom{n}{\ell}^2$ of them in an $n\times n$ matrix.…
The aim of this paper is to discuss a relationship between total positivity and planar directed networks. We show that the inverse boundary problem for these networks is naturally linked with the study of the totally nonnegative…
Curtis-Ingerman-Morrow characterize response matrices for circular planar electrical networks as symmetric square matrices with row sums zero and non-negative circular minors. In this paper, we study this positivity phenomenon more closely,…
We give a short proof of a recent result by Bernik, Mastnak, and Radjavi, stating that an irreducible group of complex matrices with nonnegative diagonal entries is diagonally similar to a group of nonnegative monomial matrices. We also…
The principal minors of a symmetric $n{\times}n$-matrix form a vector of length $2^n$. We characterize these vectors in terms of algebraic equations derived from the $ 2{\times}2{\times}2$-hyperdeterminant.
We prove that any lower unitriangular and totally nonnegative matrix gives rise to a family of polynomials with only real zeros. This has consequences for problems in several areas of mathematics. We use it to develop a general theory for…
We show how positive unital linear maps can be used to obtain some bounds for the eigenvalues of nonnegative matrices.
We study a specific texture of the neutrino mass matrix, namely the models with one $2\times 2$ subdeterminant equal to zero. We carry out a complete phenomenological analysis with all possible relevant correlations. Every pattern of the…
The McMullen Correspondence gives a linear dependence between M-sequences of length |d/2|+1 and f-vectors of simplical d-polytopes. Denote the transfer matrix between g and f by M_d. Recently, Bjorner proved that any 2x2-minor of M_d is…
We provide a combinatorial interpretation of Lah numbers by means of planar networks. Henceforth, as a conesquence of Lindstr\"om's lemma, we conclude that the related Lah matrix possesses a remarkable property of total non-negativity.
A graph is an apex graph if it contains a vertex whose deletion leaves a planar graph. The family of apex graphs is minor-closed and so it is characterized by a finite list of minor-minimal non-members. The long-standing problem of…
We show that every integer doubly nonnegative $2 \times 2$ matrix has an integer cp-factorization.
We study the convergence of distributions on finite paths of weighted digraphs, namely the family of Boltzmann distributions and the sequence of uniform distributions. Targeting applications to the convergence of distributions on paths, we…
Kenyon and Wilson showed how to test if a circular planar electrical network with $n$ nodes is well-connected by checking the positivity of $\binom{n}{2}$ central minors of the response matrix. Their test is based on the fact that any…
We investigate the tropical analogues of totally positive and totally nonnegative matrices. These arise when considering the images by the nonarchimedean valuation of the corresponding classes of matrices over a real nonarchimedean valued…
We develop a theory of minors for alternating dimaps --- orientably embedded digraphs where, at each vertex, the incident edges (taken in the order given by the embedding) are directed alternately into, and out of, the vertex. We show that…
We show that every tropical totally positive matrix can be uniquely represented as the transfer matrix of a canonical totally connected weighted planar network. We deduce a uniqueness theorem for the factorization of a tropical totally…
There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. Here we use combinatorial and probabilistic methods to investigate a…
The Hankel matrix of type B Narayana polynomials was proved to be totally positive by Wang and Zhu, and independently by Sokal. Pan and Zeng raised the problem of giving a planar network proof of this result. In this paper, we present such…