Full duality among graph algebras and flat graph algebras (Q5950759): Difference between revisions

For a graph \(G=(V,E)\), a graph algebra is a groupoid \(A(G)=(V\cup \{0 \}, \cdot)\) where \(u\cdot v = u\) if \((u,v)\in E\) and \(u\cdot v = 0\) otherwise. Dualizability in the sense of Davey and Clark for graph algebras was already investigated by B. A. Davey, P. Idziak, W. A. Lampe and G. F. McNulty. Here the authors get a criterion based on forbidden subgraphs of \(G\) ensuring dualizability of the flat graph algebra induced by \(G\). They prove that among finite graph algebras and among finite flat graph algebras, dualizability, full dualizability, strong dualizability and entropicity are equivalent. A new method for proving strong duality is presented.