Full duality among graph algebras and flat graph algebras (Q5950759): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 02:03, 30 January 2024
scientific article; zbMATH DE number 1682609
Language | Label | Description | Also known as |
---|---|---|---|
English | Full duality among graph algebras and flat graph algebras |
scientific article; zbMATH DE number 1682609 |
Statements
Full duality among graph algebras and flat graph algebras (English)
0 references
16 December 2001
0 references
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.
0 references
natural duality
0 references
graph algebra
0 references
flat graph
0 references
strong duality
0 references
full duality
0 references