6533b836fe1ef96bd12a09eb
RESEARCH PRODUCT
A computational criterion for the Kac conjecture
Sergey Mozgovoysubject
Discrete mathematicsPure mathematicsAlgebra and Number TheoryConjectureQuiverMultiplicity (mathematics)16G20High Energy Physics::TheoryFinite fieldMathematics::Quantum AlgebraFOS: MathematicsRepresentation Theory (math.RT)Mathematics::Representation TheoryIndecomposable moduleMathematics - Representation TheoryMathematicsdescription
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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2006-08-13 | Journal of Algebra |