A computational criterion for the Kac conjecture. (Q2470365): Difference between revisions

The Kac conjecture asserts that the free term of the polynomial, which counts the absolutely indecomposable representations (of given dimension) of a quiver over a finite field, coincides with the corresponding root multiplicity of the associated Kac-Moody algebra. In the paper under review the author defines a combinatorial invariant of a dimension vector, which can be used to verify the validity of the Kac conjecture. The invariant is purely computational and is suitable for computer tests. The proof is based on some recursive formulae for root multiplicities of the Kac-Moody algebra due to Peterson.