Ext classes and embeddings for -algebras of graphs with sinks.
Tomforde, Mark (2001)
The New York Journal of Mathematics [electronic only]
Similarity:
Displaying similar documents to “The -algebras of row-finite graphs.”
Ext classes and embeddings for -algebras of graphs with sinks.
-algebras associated with presentations of subshifts.
Matsumoto, Kengo (2002)
Documenta Mathematica
Similarity:
Subalgebras of graph -algebras.
Hopenwasser, Alan, Peters, Justin R., Power, Stephen C. (2005)
The New York Journal of Mathematics [electronic only]
Similarity:
The graph traces of finite graphs and applications to tracial states of -algebras.
Johnson, Matthew (2005)
The New York Journal of Mathematics [electronic only]
Similarity:
Higher rank graph -algebras.
Kumjian, Alex, Pask, David (2000)
The New York Journal of Mathematics [electronic only]
Similarity:
Classes of graphs definable by graph algebra identities or quasi-identities
Reinhard Pöschel, Walter Wessel (1987)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Simplicity of 2-graph algebras associated to dynamical systems.
Lewin, Peter, Pask, David (2010)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
On the -theory of higher rank graph -algebras.
Gwion Evans, D. (2008)
The New York Journal of Mathematics [electronic only]
Similarity:
Hyperidentities in associative graph algebras
Tiang Poomsa-ard (2000)
Discussiones Mathematicae - General Algebra and Applications
Similarity:
Graph algebras establish a connection between directed graphs without multiple edges and special universal algebras of type (2,0). We say that a graph G satisfies an identity s ≈ t if the correspondinggraph algebra A(G) satisfies s ≈ t. A graph G is called associative if the corresponding graph algebra A(G) satisfies the equation (xy)z ≈ x(yz). An identity s ≈ t of terms s and t of any type τ is called a hyperidentity of an algebra A̲ if whenever the operation symbols occurring in s...