A computational criterion for the Kac conjecture

[摘要] 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. (c) 2007 Elsevier Inc. All rights reserved.

[发布日期] 2007-12-15