A computational criterion for the Kac conjecture
classification
🧮 math.RT
keywords
criterionconjectureabsolutelyalgebraassertingassociatedcoincidescomputational
read the original abstract
We give a criterion for the Kac conjecture asserting that the free term of the polynomial counting the absolutely indecomposable representations of a quiver over a finite field of given dimension coincides with the corresponding root multiplicity of the associated Kac-Moody algebra. Our criterion suits very well for computer tests.
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.