✦ LIBER ✦

On the word problem of lattices with the help of graphs

✍ Scribed by G. Czédli

Publisher: Springer Netherlands
Year: 1991
Tongue: English
Weight: 468 KB
Volume: 23
Category: Article
ISSN: 0031-5303
DOI: 10.1007/bf02260393

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the word problem for the modular latt

On the word problem for the modular lattice with four free generators

✍ Christian Herrmann 📂 Article 📅 1983 🏛 Springer 🌐 English ⚖ 730 KB

Word Problem of the Perkins Semigroup vi

Word Problem of the Perkins Semigroup via Directed Acyclic Graphs

✍ Sergey Kitaev; Steve Seif 📂 Article 📅 2008 🏛 Springer Netherlands 🌐 English ⚖ 421 KB

On an isomorphism problem on the closed-

On an isomorphism problem on the closed-set lattice of a graph

✍ K. M. Koh; K. S. Poh 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 413 KB

On the decidability of the word problem

On the decidability of the word problem for

✍ M. Mazzucchelli; A. Cherubini 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 506 KB

On the covering graph of balanced lattic

On the covering graph of balanced lattices

✍ Manfred Stern 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 283 KB

Jakubik has shown that for discrete modular lattices all graph isomorphisms are given by certain direct product decompositions. Duffus and Rival have proved a similar theorem for graded lattices which are atomistic and coatomistic. Modifying some of the results of Duffus and Rival we give a common g

A note on the exceptional graph of the c

A note on the exceptional graph of the cubic lattice graph characterization

✍ Curtis R Cook 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 253 KB