Powers of matrices over distributive lattices—a review
✍ Scribed by Katarı́na Cechlárová
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 360 KB
- Volume
- 138
- Category
- Article
- ISSN
- 0165-0114
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Let (L, , ∨, ∧) be a complete and completely distributive lattice. A vector ξ is said to be an eigenvector of a square matrix A over the lattice L if Aξ = λξ for some λ in L. The elements λ are called the associated eigenvalues. In this paper, we obtain the maximum eigenvector of A for a given eigen
Let (L, <~, v. A) be a complete and completely distr;butive I,ttice. A vector ~ is said to be an eigenvector of a square matrix A over the lattice L ifA~ = 2~ for some 2 E L. The elements ,;. are called the associated eigenvalues, in this paper we characterize the eigenvalues and the eigenvectors an
An ordered compact space is a compact topological space X, endowed with a partially ordered relation, whose graph is a closed set of X x X (of. [4]). An important subclass of these spaces is that of Priest/ey spaces, characterized by the following property: for every x, y ~X with x~y there is an inc
It is shown that any subvariety Y of the variety of bounded distributive lattices with a quantifier, as considered by Cignoli (1991), contains either uncountably or finitely many quasivarieties depending on whether Vcontains the 4-element bounded Boolean lattice with a simple quantifier. It is also