Constructions of \(S\)-lattices (Q1176977): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Jiří Rosický / rank | |||
Property / reviewed by | |||
Property / reviewed by: Jiří Rosický / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Simple Solution to the Word Problem for Lattices / 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: Q4177619 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf00418653 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2128331782 / rank | |||
Normal rank |
Latest revision as of 09:44, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Constructions of \(S\)-lattices |
scientific article |
Statements
Constructions of \(S\)-lattices (English)
0 references
25 June 1992
0 references
There is given a construction of lattices whose covering graphs can be oriented as a graded order with bottom \(v\) for any vertex \(v\) in the lattice.
0 references
lattices
0 references
covering graphs
0 references