Constructions of \(S\)-lattices (Q1176977): Difference between revisions

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

Mathematics Subject Classification ID

05C99

0 references

0 references

0 references

0 references

lattices

0 references

covering graphs

0 references

reviewed by

Jiří Rosický

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A Simple Solution to the Word Problem for Lattices

0 references

Path length in the covering graph of a lattice

0 references

Q4177619

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1176977

@@ Property / reviewed by @@
-Jiří Rosický
@@ Property / reviewed by: Jiří Rosický / rank @@
-Normal rank
@@ Property / reviewed by @@
+Jiří Rosický
@@ Property / reviewed by: Jiří Rosický / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A Simple Solution to the Word Problem for                         Lattices
+Normal rank
@@ Property / cites work @@
+Path length in the covering graph of a lattice
@@ Property / cites work: Path length in the covering graph of a lattice / rank @@
+Normal rank
@@ Property / cites work @@
+Q4177619
@@ Property / cites work: Q4177619 / rank @@
+Normal rank