Kac's Theorem for equipped graphs and for maximal rank representations
classification
🧮 math.RT
keywords
representationsequippedgraphsmaximalquiversranktheoremcertain
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.