Level sets in finite distributive lattices of breadth 3
โ Scribed by Gerhard Gierz
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 872 KB
- Volume
- 132
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
A level set in a distributive lattice consists of all elements of a certain fixed rank r. In this note we give a characterization of maximal level sets in distributive lattices of breadth 3. Several applications are given, one of which shows that if a distributive lattice L of breadth 3 is generated by a level set A of maximal cardinality, then A consists of all elements for which the rank is equal $ times the rank of the largest element of L.
๐ SIMILAR VOLUMES
Let n k denote the number of times the kth largest distance occurs among a set S of n points. We show that if S is the set of vertices of a convex polygone in the euclidean plane, then n1+2n2~3n and n2<~n +n 1. Together with the well-known inequality n~<~n and the trivial inequalities n~>~O and n2>~
## Abstract Cumulating evidence has led to the idea that nuclear functions such as DNA replication, RNA transcription, RNA splicing and nucleocytoplasmic transport are facilitated by a proteinaceous architectural framework within the nuclear compartment and at the nuclear envelope. In the present s