On the widths of finite distributive lattices (Q1821126): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3050437 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5331549 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3956998 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4096951 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lattices with unique irreducible decompositions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Meet-distributive lattices and the anti-exchange closure / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A size-width inequality for distributive lattices / rank | |||
Normal rank |
Latest revision as of 19:20, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the widths of finite distributive lattices |
scientific article |
Statements
On the widths of finite distributive lattices (English)
0 references
1987
0 references
The authors improve a theorem of Faigle and Sands: For a finite distributive lattice L of width w(L) holds \[ w(L)/| L| =O((\log \log | L|)^{-(-\epsilon)}), \] \(\epsilon\) \(>0\). In particular, for every \(R>0\) there exists a number n(R) such that if w(L)\(\geq n(R)\) then \(| L| \geq R\cdot w(L)\). It is conjectured that \(w(L)/| L| =O((\log | L|)^{-})\) and that \(\lim_{| L| \to \infty}w(L)/| L| \to 0\) for meet distributive lattices L.
0 references
finite distributive lattice
0 references
width
0 references