Dualizability and graph algebras (Q1972139): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q170377 |
Set profile property. |
||
(One intermediate revision by one other user not shown) | |||
Property / author | |||
Property / author: Paweł M. Idziak / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 00:31, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Dualizability and graph algebras |
scientific article |
Statements
Dualizability and graph algebras (English)
0 references
22 June 2000
0 references
This paper serves two purposes: it provides a characterization of finite graph algebras which are dualizable, and it elaborates some techniques which promise to be useful in establishing that various finite algebras are not dualizable. Those techniques are also applied herein to sharpen some existing nondualizability results. The main result of this paper is the equivalence: A finite graph algebra is dualizable iff each connected component of the underlying graph is either complete or complete bipartite (or a single point). This in turn is known to be equivalent to the graph algebra having a finitely axiomatizable equational theory.
0 references
natural duality
0 references
inherently nondualizable
0 references
dualizability
0 references
finite graph algebras
0 references
nondualizability
0 references
finitely axiomatizable equational theory
0 references