Abstract
Let a⊕b=max(a,b) and a⊗b=a+b for a,b∈R¯:=R∪{-∞} and extend these operations to matrices and vectors as in conventional linear algebra. The following eigenvector problem has been intensively studied in the past: Given A∈R¯n×n find all x∈R¯n,x≠(-∞,…,-∞)T (eigenvectors) such that A⊗x=λ⊗x for some λ∈R¯. The present paper deals with the permuted eigenvector problem: Given A∈R¯n×n and x∈R¯n, is it possible to permute the components of x so that it becomes a (max-algebraic) eigenvector of A? Using a polynomial transformation from BANDWIDTH we prove that the integer version of this problem is NP-complete.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.