Extremals of the supereigenvector cone in max algebra: a combinatorial description
Sergei Sergeev
TL;DR
This paper provides a combinatorial characterization of extremal generators within the supereigenvector cone in max algebra, enhancing understanding of its structure.
Contribution
It introduces a novel combinatorial description of extremal generators for the supereigenvector cone in max algebra, which was not previously known.
Findings
Provides a combinatorial description of extremal generators
Enhances understanding of the structure of the supereigenvector cone
Offers tools for analyzing max algebraic systems
Abstract
We give a combinatorial description of extremal generators of the supereigenvector cone {x: Ax>=x} in max algebra.
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.