0000000000828642

AUTHOR

Sergey Mozgovoy

showing 1 related works from this author

A computational criterion for the Kac conjecture

2006

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.

Discrete mathematicsPure mathematicsAlgebra and Number TheoryConjectureQuiverMultiplicity (mathematics)16G20High Energy Physics::TheoryFinite fieldMathematics::Quantum AlgebraFOS: MathematicsRepresentation Theory (math.RT)Mathematics::Representation TheoryIndecomposable moduleMathematics - Representation TheoryMathematicsJournal of Algebra
researchProduct