The Leavitt path algebra of a graph

By G. Abrams, G. Pino. 2005

444 citations recorded by the source corpus.

Abstract For any row-finite graph E and any field K we construct the Leavitt path algebra L ( E ) having coefficients in K . When K is the field of complex numbers, then L ( E ) is the algebraic analog of the Cuntz–Krieger algebra C ∗ ( E ) described in [I. Raeburn, Graph algebras, in: CBMS Reg. Conf. Ser. Math., vol. 103, Amer. Math. Soc., 2005]. The matrix rings M n ( K ) and the Leavitt algebras L ( 1 , n ) appear as algebras of the form L ( E ) for various graphs E . In our main result, we give necessary and sufficient conditions on E which imply that L ( E ) is simple.

Subfields: Algebra and Number Theory, Mathematical Physics, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/3a37253dd6993333ef7b5994dc16fdd4102885ec

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

  1. G. Abrams
  2. Aidan Sims
  3. Roozbeh Hazrat
  4. M. Tomforde
  5. P. Ara
  6. G. Pino
  7. Kulumani M. Rangaswamy
  8. R. Exel

In Mathematical Physics

  1. G. Abrams
  2. Aidan Sims
  3. Roozbeh Hazrat
  4. M. Tomforde
  5. P. Ara
  6. G. Pino
  7. R. Exel
  8. Kulumani M. Rangaswamy

In Statistical and Nonlinear Physics

  1. M. Tomforde
  2. G. Abrams
  3. Roozbeh Hazrat
  4. Mercedes Siles Molina
  5. Kulumani M. Rangaswamy
  6. G. Pino
  7. Enrique Pardo
  8. P. Ara

Citations in the corpus