Counting representations of quivers over finite fields (Q1977557): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jabr.1999.8220 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971467621 / rank
 
Normal rank

Revision as of 19:40, 19 March 2024

scientific article
Language Label Description Also known as
English
Counting representations of quivers over finite fields
scientific article

    Statements

    Counting representations of quivers over finite fields (English)
    0 references
    0 references
    21 August 2001
    0 references
    Let \(\mathbb{F}_q\) be a finite field with \(q\) elements. For a quiver \(\vec\Gamma\) with \(n\) vertices, and a fixed dimension vector \(\alpha\in\mathbb{N}^n\), let \(M(q)\) (resp. \(I(q)\); \(A(q)\)) denote the number of isomorphism classes of (indecomposable; abolutely indecomposable) representations of \(\Gamma\) over \(\mathbb{F}_q\) with dimension vector \(\alpha\). Kac proved that \(M(q)\) and \(I(q)\) are rational polynomials, whereas \(A(q)\in\mathbb{Z}[q]\). Furthermore, he showed that all three polynomials merely depend on the underlying graph \(\Gamma\) of \(\vec\Gamma\). If \(\vec\Gamma\) has no edge loops, then \(\Gamma\) defines a Kac-Moody algebra. Then one of Kac's conjectures states that \(A(0)\) is equal to the dimension of the root space of \(\alpha\). The author establishes a formula for \(A(q)\), and proves a multi-variable formal identity which yields a characterization of Kac's conjecture in terms of a combinatorial identity [cf. \textit{B. Sevenhant, M. Van den Bergh}, J. Algebra 221, No. 1, 29-49 (1999; Zbl 0965.16007)].
    0 references
    0 references
    representations of quivers
    0 references
    indecomposable representations
    0 references
    combinatorial identities
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references