Bounds for the completely positive rank of a symmetric matrix over a tropical semiring
From MaRDI portal
Publication:4568079
Abstract: In this paper, we find an upper bound for the CP-rank of a matrix over a tropical semiring, according to the vertex clique cover of the graph prescribed by the pattern of the matrix. We study the graphs that beget the patterns of matrices with the lowest possible CP-ranks and prove that any such graph must have its diameter equal to 2.
Recommendations
Cites work
- scientific article; zbMATH DE number 3582190 (Why is no real title available?)
- scientific article; zbMATH DE number 1933860 (Why is no real title available?)
- Bounding the CP-rank by graph parameters
- Completely positive matrices associated withM-matrices
- Completely positive matrices over Boolean algebras and their CP-rank
- Covering edges by cliques with regard to keyword conflicts and intersection graphs
- From seven to eleven: completely positive matrices with high cp-rank
- Graphs, dioids and semirings. New models and algorithms.
- New lower bounds and asymptotics for the cp-rank
- On the max-min and tropical CP-rank conjectures
- Open problems in the theory of completely positive and copositive matrices
- RANK INEQUALITIES OVER SEMIRINGS
- The ultimate rank of tropical matrices
- Three notions of tropical rank for symmetric matrices
Cited in
(6)- Bounding the CP-rank by graph parameters
- Certain congruences on the semiring of normal tropical matrices
- New bounds on the periodicity transient of the powers of a tropical matrix: using cyclicity and factor rank
- Tropical independence. II: The maximal rank conjecture for quadrics
- Tropical bounds for eigenvalues of matrices
- A note on upper bounds on the cp-rank
This page was built for publication: Bounds for the completely positive rank of a symmetric matrix over a tropical semiring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4568079)