paper

A computational criterion for the Kac conjecture

arXiv:math/0608321 · doi:10.1016/j.jalgebra.2007.02.018

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.

Cited by in corpus (6)

A computational criterion for the Kac conjecture · wovepaper