On the Order Complex of a Prelattice
β Scribed by Yoav Segev
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 215 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
β¦ Synopsis
In this note a prelattice L is a poset ( Ο partially ordered set) ( L , Ρ ) such that L Ο L Κ Ν 0 , 1 Ν is a lattice , where 0 and 1 are two new elements such that 0 Ο½ x Ο½ 1 , for all x L (see Definition 2 . 1) .
Let L be a finite prelattice . The main result in this note is closely related to a recent result of Andreas Blass and Bruce Sagan [2] on the Mo Β¨ bius function of L . In [2] , Blass
π SIMILAR VOLUMES
Let A be a set of non-negative integers. If every sufficiently large integer is the sum of h not necessarily distinct elements of A, then A is called an asymptotic basis of order h. An asymptotic basis A of order h is called minimal if no proper subset of A is an asymptotic basis of order h. It is p
By means of two typical examples it is shown that in general the minimal order of a stabilizing stable compensator may not be bounded in terms of the plant order. Such bounds can only be given in the special case of plants with at most one right half plane zero. Implications for the simultaneous sta
The notion of an order domain is generalized. The behaviour of an order domain by taking a subalgebra, the extension of scalars, and the tensor product is studied. The relation of an order domain with valuation theory, Gr . o obner algebras, and graded structures is given. The theory of Gr . o obn