A computational criterion for the Kac conjecture
Representation Theory
2007-08-09 v2
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.
Cite
@article{arxiv.math/0608321,
title = {A computational criterion for the Kac conjecture},
author = {Sergey Mozgovoy},
journal= {arXiv preprint arXiv:math/0608321},
year = {2007}
}