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.
On sublattices of the hexagonal lattice
โ Scribed by M. Bernstein; N.J.A. Sloane; Paul E. Wright
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 404 KB
- Volume
- 170
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
How many sublattices of index N are there in the planar hexagonal lattice? Which of them are the best from the point of view of packing density, signal-to-noise ratio, or energy? We answer the first question completely and give partial answers to the other questions.
๐ SIMILAR VOLUMES
## Abstract Let __E__ be a Banach lattice. Let __H__ stand for a sublattice, an ideal or a band in __E__, and denote by ฮฆ~1~(__E__) and ฮฆ~1~(__H__) the ideals of finite elements in the vector lattices __E__ and __H__, respectively. In this paper we first present some sufficient conditions and some
A pre-natural class of modules over a ring R is one that is closed under isomorphic copies, submodules, arbitrary direct sums, and certain essential extensions. The set p r R of all pre-natural classes is a lattice, which contains many previously studied lattices of R-module classes. The sublattice
Let L be the lattice of all vertex points in a tiling of the plane by regular hexagons of unit area. Suppose the vertices of a planar polygon P are points of the lattice L, and points of L occur frequently along the edges of P. Then the area of P is A(P) = ;b + ii + &c -1, where b is the number of l
In this article, we determine the probability of existence of small lattices in random subsets of a Boolean lattice. Furthermore, we address some Ramsey-and Turan-type questions. Analogous questions have been studied extensively for random graphs, but it turns out that the situation for Boolean lat