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 A⊤x=λe, with λ∈R and e the vector of all ones, are linear combinations of ‘fundamental’ solutions to A⊤x=e and vectors in kerA⊤, each of which is associated with a closed strongly connected component (SCC) of G(A). This allows us to characterize the sign of detA in terms of the number of closed SCCs and the solutions to A⊤x=e. In addition, we provide conditions for A to be a P-matrix.
| Original language | English |
|---|---|
| Pages (from-to) | 200-219 |
| Number of pages | 20 |
| Journal | Linear Algebra and its Applications |
| Volume | 673 |
| Early online date | 16 May 2023 |
| DOIs | |
| Publication status | Published - 15 Sept 2023 |
Bibliographical note
Funding Information:The authors are grateful to Universitas Gadjah Mada for partially funding this research through the RTA program.
Publisher Copyright:
© 2023 The Author(s)
Funding
The authors are grateful to Universitas Gadjah Mada for partially funding this research through the RTA program.
Keywords
- Determinant sign
- Directed graph
- Matrix class
- P-matrix
Fingerprint
Dive into the research topics of 'On the class of matrices with rows that weakly decrease cyclicly from the diagonal'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver