Spectral Lattices of Reducible Matrices over Completed Idempotent Semifields
نویسندگان
چکیده
Previous work has shown a relation between L-valued extensions of FCA and the spectra of some matrices related to L-valued contexts. We investigate the spectra of reducible matrices over completed idempotent semifields in the framework of dioids, naturally-ordered semirings, that encompass several of those extensions. Considering special sets of eigenvectors also brings out complete lattices in the picture and we argue that such structure may be more important than standard eigenspace structure for matrices over completed idempotent semifields.
منابع مشابه
On the nil-clean matrix over a UFD
In this paper we characterize all $2times 2$ idempotent and nilpotent matrices over an integral domain and then we characterize all $2times 2$ strongly nil-clean matrices over a PID. Also, we determine when a $2times 2$ matrix over a UFD is nil-clean.
متن کاملExtending the HITS Algorithm over Dioids
In this paper we introduce extensions of Kleinberg’s Hubs & Authorities (HITS) algorithm to calculate the influence of nodes in a network whose adjacency matrix takes values over dioids, zerosumfree semirings with a natural order. We relate these extensions to both the Singular Value Problem and the Eigen Problem of matrices in these semirings. We show the original HITS algorithm to be a partic...
متن کاملLinear Projectors in the max-plus Algebra
In general semimodules, we say that the image of a linear operator B and the kernel of a linear operator C are direct factors if every equivalence class modulo C crosses the image of B at a unique point. For linear maps represented by matrices over certain idempotent semifields such as the (max,+)-semiring, we give necessary and sufficient conditions for an image and a kernel to be direct facto...
متن کاملIdempotent and Compact Matrices on Linear Lattices : a Survey of Some Lattice Results and Related Solutions of Finite Relational Equations
After a survey of some known lattice results, we determine the greatest idempotent (resp. compact) solution, when it exists, of a finite square rational equation assigned over a linear lattice. Similar considerations are presented for composite relational equations.
متن کاملar X iv : m at h / 02 06 02 5 v 1 [ m at h . R T ] 4 J un 2 00 2 IDEMPOTENT ( ASYMPTOTIC ) MATHEMATICS AND THE REPRESENTATION THEORY
1. Introduction. Idempotent Mathematics is based on replacing the usual arithmetic operations by a new set of basic operations (e.g., such as maximum or minimum), that is on replacing numerical fields by idempotent semirings and semifields. Typical (and the most common) examples are given by the so-called (max, +) algebra R max and (min, +) algebra R min. Let R be the field of real numbers. The...
متن کامل