A computational criterion for the Kac conjecture

Details A computational criterion for the Kac conjecture A computational criterion for the Kac conjecture

2006-08-13

arxiv.org/abs/math/0608321v2

Mathematics

Representation Theory

Scientific paper

10.1016/j.jalgebra.2007.02.018

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.

Affiliated with

Also associated with

No associations

Rating

A computational criterion for the Kac conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A computational criterion for the Kac conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A computational criterion for the Kac conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-242958