A Combinatorial Discussion on Finite Dimensional Leavitt Path Algebras

Mathematics – Rings and Algebras

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

10 pages, 5 figures

Scientific paper

Any finite dimensional semisimple algebra A over a field K is isomorphic to a direct sum of finite dimensional full matrix rings over suitable division rings. In this paper we will consider the special case where all division rings are exactly the field K. All such finite dimensional semisimple algebras arise as a finite dimensional Leavitt path algebra. For this specific finite dimensional semisimple algebra A over a field K, we define a uniquely detemined specific graph - which we name as a truncated tree associated with A - whose Leavitt path algebra is isomorphic to A. We define an algebraic invariant {\kappa}(A) for A and count the number of isomorphism classes of Leavitt path algebras with {\kappa}(A)=n. Moreover, we find the maximum and the minimum K-dimensions of the Leavitt path algebras of possible trees with a given number of vertices and determine the number of distinct Leavitt path algebras of a line graph with a given number of vertices.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Combinatorial Discussion on Finite Dimensional Leavitt Path Algebras does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Combinatorial Discussion on Finite Dimensional Leavitt Path Algebras, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Combinatorial Discussion on Finite Dimensional Leavitt Path Algebras will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-393534

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.