Abstract
The operations ⊕ and ⊗ are defined by a ⊕ b = max{a, b}, a ⊗ b = a + b over the set of reals extended by -∞. The columns a(1), . . . , a(n) of an n × n matrix A are said to be linearly dependent in max-algebra if ∑⊕j∈Uλj⊗a (j)=∑⊕j∈vλj⊗a (j) holds for some λ1, . . . , λn ∈ R; U, V ≠ ∅ U ∩ V = ∅ U ∪ V = {1, . . ., n}. We prove that there is a close relationship between sign-nonsingular (SNS) (0, 1, -1) matrices and matrices with unbalanced determinant in symmetrised semirings. Given a matrix A we then show how to construct a (0, 1, -1) matrix à such that A has columns linearly dependent in max-algebra if and only if à is not SNS. Also, it follows that if the system A ⊗ x = B ⊗ x has a nontrivial solution then C̃ is not SNS, where C = AΘB (here Θ stands for the subtraction in the symmetrised semiring). As another corollary we have a new, independent proof that the problems of checking whether a matrix is SNS and that of deciding whether a digraph contains a cycle of even length, are polynomially equivalent.
| Original language | English |
|---|---|
| Pages (from-to) | 195-201 |
| Number of pages | 7 |
| Journal | Linear Algebra and Its Applications |
| Volume | 301 |
| Issue number | 1-3 |
| DOIs | |
| Publication status | Published - 1 Nov 1999 |
Keywords
- Even cycle
- Linear dependence
- Max-algebra
- Sign-nonsingular matrix
- Symmetrised semining
Fingerprint
Dive into the research topics of 'Sign-nonsingular matrices and matrices with unbalanced determinant in symmetrised semirings'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver