Kac's Theorem for equipped graphs and for maximal rank representations

Details Kac's Theorem for equipped graphs and for maximal rank representations Kac's Theorem for equipped graphs and for maximal rank representations

2011-07-28

arxiv.org/abs/1107.5726v2

Mathematics

Representation Theory

4 pages; v2 corrects slightly garbled proof of Theorem 2.1

Scientific paper

We give two generalizations of Kac's Theorem on representations of quivers.
One is to representations of equipped graphs by relations, in the sense of
Gelfand and Ponomarev. The other is to representations of quivers in which
certain of the linear maps are required to have maximal rank.

Affiliated with

Also associated with

No associations

Rating

Kac's Theorem for equipped graphs and for maximal rank representations 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 Kac's Theorem for equipped graphs and for maximal rank representations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Kac's Theorem for equipped graphs and for maximal rank representations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-414303