A computational criterion for the Kac conjecture

Simple item page
dc.creatorMozgovoy, Sergey
dc.date2006-08-13
dc.date2007-08-09
dc.date.accessioned2026-07-07T08:22:50Z
dc.date.available2026-07-07T08:22:50Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/math/0608321
dc.identifierhttp://arxiv.org/abs/math/0608321
dc.identifierdoi:10.1016/j.jalgebra.2007.02.018
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/135789
dc.subjectRepresentation Theory
dc.subject16G20
dc.titleA computational criterion for the Kac conjecture
dc.typetext

Files

Collections

arXiv