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
On the transitive matrices over distributive lattices
β Scribed by Yi-Jia Tan
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 293 KB
- Volume
- 400
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
This paper gives a method for computing the reduced poset homology of the rank-selected subposet of a distributive lattice. As an example of the method, let L be the lattice S b acts on L by permuting coordinates. For S β [ab], we give a description of the decomposition of the reduced homology of L