Finite bases for flat graph algebras (Q5956274): Difference between revisions

Let \(\langle V,E\rangle\) be a graph where \(V\) is the set of vertices and \(E\) is the set of edges. A graph algebra corresponding to this graph is an algebra of type \(\langle 2\rangle\) whose universe is \(A=V\cup \{0\}\), \(\{0\}\notin V\) and whose binary operation \(\circ\) is defind by the rule: \(a\circ b=a\) whenever \((a,b)\in E\) and \(a\circ b=0\) otherwise. In papers of \textit{G. McNulty} and \textit{C. Shallon} [Lecture Notes Math. 1004, 206-231 (1983; Zbl 0513.08003)] and \textit{K. Baker, G. McNulty} and \textit{H. Werner} [Acta Sci. Math. 51, 3-15 (1987; Zbl 0629.08003)] the finite basis property for graph algebras was investigated. In the article under review, so-called flat algebras are examined. A flat algebra is an algebra of the kind \(\langle A;\circ,\wedge,0\rangle\) where: 1) \(\circ\) and \(\wedge\) are binary operations and 0 is a constant; 2) \(\langle A;\wedge \rangle\) is a height-1 meet-semilattice with the least element 0 (that is, a \(\wedge\)-semilattice such that for every \(a\in A\) with \(a>0\) there is no element \(b\) with \(a>b>0\)); 3) \(\langle A;\circ\rangle\) is a graph algebra corresponding to the graph \(\langle V,E\rangle\) where \(A=V\cup\{0\}\). The main result of the article (Theorem 6) states that if a finite flat algebra omits four concrete flat algebras, then it is finitely based. The four flat algebras from Theorem 6 are just the same that were considered in the article of K. Baker, G. McNulty and H. Werner mentioned above.