A note on representation of lattices by tolerances
✍ Scribed by Ivan Chajda; Gábor Czédli
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 86 KB
- Volume
- 148
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Any nonvoid lattice of subspaces from R" is known to be a complete lattice, and hence it has a largest and smallest element. Here we show that for a specific class of subspaces also the converse is true. If this class has a largest and a smallest element, then it is a complete lattice. Within the co
The highest possible minimal norm of a unimodular lattice is determined in dimensions n 33. There are precisely five odd 32-dimensional lattices with the highest possible minimal norm (compared with more than 8.10 20 in dimension 33). Unimodular lattices with no roots exist if and only if n 23, n{25
A partial ordering is defined for monotone projections on a lattice, such that the set of these mappings is a lattice which is isomorphic to a sublattice of the partition lattice.