On the independence of a postulate system for the distributive lattices
✍ Scribed by G. Szász
- Publisher
- Springer
- Year
- 1951
- Tongue
- English
- Weight
- 161 KB
- Volume
- 124
- Category
- Article
- ISSN
- 0025-5831
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
The following conjecture of U Faigle and B Sands is proved: For every number R > 0 there exists a number n(R) such that if 2 is a finite distributive lattice whose width w(Z) (size of the largest antichain) is at least n(R), then IZ/a Rw(Z). In words this says that as one considers ~ increasingly la
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