On the covering graph of balanced lattices (Q1923532): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5331549 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Path length in the covering graph of a lattice / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Geometries on partially ordered sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Unoriented graphs of modular lattices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3726174 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Kurosh-Ore exchange property / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3926633 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 14:43, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the covering graph of balanced lattices |
scientific article |
Statements
On the covering graph of balanced lattices (English)
0 references
11 May 1997
0 references
The paper concerns covering graphs of lattices, i.e. their undirected Hasse diagrams. By \(J(L)\) the set of join-irreducible non-zero elements of a lattice \(L\) is denoted, the symbol \(j'\) for \(j\in L\) denotes the unique lower cover of \(j\). A lattice \(L\) of finite length is called strong, if for all \(j\in J(L)\) and \(x\in L\) the inequality \(j\leq x\vee j'\) implies \(j\leq x\). If both \(L\) and its dual lattice are strong, the lattice \(L\) is called balanced. The main result is the following theorem: Let \(L\) and \(L'\) be graded lattices with graph isomorphic covering graphs. \(L\) is balanced if and only if \(L'\) is balanced. Moreover, if this condition is satisfied, then there are sublattices \(A\) and \(B\) of \(L\) such that \(L\cong A\times B\) and \(L'\cong A^d\times B\). (Here \(A^d\) denotes the lattice dual to \(A\)). There are two corollaries of this theorem, one of them was proved as a theorem by D. Duffus and I. Rival, the other by J. Jakubík.
0 references
balanced lattice
0 references
covering graphs of lattices
0 references
undirected Hasse diagrams
0 references
graded lattices
0 references