Higher rank graph -algebras.
Kumjian, Alex, Pask, David (2000)
The New York Journal of Mathematics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Kumjian, Alex, Pask, David (2000)
The New York Journal of Mathematics [electronic only]
Similarity:
Bates, Teresa, Pask, David, Raeburn, Iain, Szymański, Wojciech (2000)
The New York Journal of Mathematics [electronic only]
Similarity:
Matsumoto, Kengo (2002)
Documenta Mathematica
Similarity:
Tomforde, Mark (2001)
The New York Journal of Mathematics [electronic only]
Similarity:
Davidson, Kenneth R., Yang, Dilian (2009)
The New York Journal of Mathematics [electronic only]
Similarity:
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...
Royle, Gordon F. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Stacey, P.J. (2006)
The New York Journal of Mathematics [electronic only]
Similarity:
Johnson, Matthew (2005)
The New York Journal of Mathematics [electronic only]
Similarity:
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...
Dobrynin, V., Pliskin, M., Prosolupov, E. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Feighn, Mark, Handel, Michael (1999)
Annals of Mathematics. Second Series
Similarity:
Lewin, Peter, Pask, David (2010)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Power, Stephen C. (2007)
The New York Journal of Mathematics [electronic only]
Similarity: