Higher rank graph -algebras.
Kumjian, Alex, Pask, David (2000)
The New York Journal of Mathematics [electronic only]
Similarity:
Displaying similar documents to “On the -theory of higher rank graph -algebras.”
Higher rank graph -algebras.
The -algebras of row-finite graphs.
Bates, Teresa, Pask, David, Raeburn, Iain, Szymański, Wojciech (2000)
The New York Journal of Mathematics [electronic only]
Similarity:
-algebras associated with presentations of subshifts.
Matsumoto, Kengo (2002)
Documenta Mathematica
Similarity:
Ext classes and embeddings for -algebras of graphs with sinks.
Tomforde, Mark (2001)
The New York Journal of Mathematics [electronic only]
Similarity:
Representations of higher rank graph algebras.
Davidson, Kenneth R., Yang, Dilian (2009)
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...
The rank of a cograph.
Royle, Gordon F. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Real structure in unital separable simple -algebras with tracial rank zero and with a unique tracial state.
Stacey, P.J. (2006)
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:
Hyperidentities in transitive graph algebras
Tiang Poomsa-ard, Jeerayut Wetweerapong, Charuchai Samartkoon (2005)
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 corresponding graph algebra A(G) satisfies s ≈ t. A graph G = (V,E) is called a transitive graph if the corresponding graph algebra A(G) satisfies the equation x(yz) ≈ (xz)(yz). An identity s ≈ t of terms s and t of any type t is called a hyperidentity of an algebra A̲ if whenever the operation symbols...
On the functions with values in .
Dobrynin, V., Pliskin, M., Prosolupov, E. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Mapping tori of free group automorphisms are coherent.
Feighn, Mark, Handel, Michael (1999)
Annals of Mathematics. Second Series
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:
Classifying higher rank analytic Toeplitz algebras.
Power, Stephen C. (2007)
The New York Journal of Mathematics [electronic only]
Similarity: