2007
DOI: 10.1016/j.jalgebra.2007.02.018
|View full text |Cite
|
Sign up to set email alerts
|

A computational criterion for the Kac conjecture

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

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
32
0
1

Year Published

2009
2009
2024
2024

Publication Types

Select...
7

Relationship

3
4

Authors

Journals

citations
Cited by 25 publications
(33 citation statements)
references
References 10 publications
0
32
0
1
Order By: Relevance
“…. , x r ]] with a structure of a λ-ring (see [7,Appendix]) in terms of Adams operations by ψ n (f (q, x 1 , . .…”
Section: Combinatorial Prerequisitesmentioning
confidence: 99%
See 3 more Smart Citations
“…. , x r ]] with a structure of a λ-ring (see [7,Appendix]) in terms of Adams operations by ψ n (f (q, x 1 , . .…”
Section: Combinatorial Prerequisitesmentioning
confidence: 99%
“…Lemma 2.1 ([7,Lemma 22]). Let f ∈ 1 + m and g ∈ R. Define the elements g d ∈ R, d ≥ 1 by the formula d|n d · g d = ψ n (g), n ≥ 1.…”
Section: Combinatorial Prerequisitesmentioning
confidence: 99%
See 2 more Smart Citations
“…Let k be a finite field with q elements, put H D (r, d) = (−q 1 2 ) −lr 2 |Higgs ss D (r, d)(k)| , and define the DT-invariants Ω D (r, d) by the formulawhere Log is the plethystic logarithm (see below or e.g. [13]). It was conjectured in [15] that Ω D (r, d) is a polynomial in the Weil numbers of X which is independent of d, regardless of whether gcd(r, d) = 1 or not.…”
mentioning
confidence: 99%