On the class of matrices with rows that weakly decrease cyclicly from the diagonal

Abstract

We consider n× n real-valued matrices A = (aij) satisfying aii ≥ ai,i+1 ≥ … ≥ ain ≥ ai1 ≥ … ≥ ai,i-1 for i = 1,…,n. With such a matrix A we associate a directed graph G(A). We prove that the solutions to the system AT x = λ e, with λ ∈ R and e the vector of all ones, are linear combinations of 'fundamental' solutions to AT x=e and vectors in AT, each of which is associated with a closed strongly connected component (SCC) of G(A). This allows us to characterize the sign of A in terms of the number of closed SCCs and the solutions to AT x = e. In addition, we provide conditions for A to be a P-matrix.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…