Extremality criteria for the supereigenvector space in max-plus algebra
Sergei Sergeev, Hui-li Wang

TL;DR
This paper establishes necessary and sufficient conditions for extremality of supereigenvectors in max-plus algebra and provides an efficient $O(n^2)$ verification method.
Contribution
It introduces extremality criteria for max-algebraic supereigenvectors and offers a polynomial-time verification process.
Findings
Extremality criteria are both necessary and sufficient.
Verification of extremality can be performed in $O(n^2)$ time.
Provides a practical method for analyzing solutions in max-plus algebra.
Abstract
We present necessary and sufficient criteria for a max-algebraic supereigenvector, i.e., a solution of the system with in max-plus algebra, to be an extremal. We also show that the suggested extremality criteria can be verified in time for any given solution .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topics in Algebra · Polynomial and algebraic computation · Rings, Modules, and Algebras
