[Paper Review] On the number of stable quiver representations over finite fields

Sergey Mozgovoy, Markus Reineke|ArXiv.org|Aug 9, 2007

Algebraic structures and combinatorial models8 references3 citations

TL;DR

This paper derives a new closed-form formula for the generating function of polynomials counting absolutely stable quiver representations over finite fields using λ-ring techniques and Hall algebra methods. The key contribution is a simplified expression for the generating function, with explicit results for irreducible representations—particularly proving the linear term in the q-expansion matches the number of primitive necklaces, and conjecturing nonnegative Taylor coefficients at q=1.

ABSTRACT

We prove a new formula for the generating function of polynomials counting absolutely stable representations of quivers over finite fields. The case of irreducible representations is studied in more detail.

Motivation & Objective

• To derive a non-recursive, closed-form formula for the generating function counting absolutely stable quiver representations over finite fields.
• To specialize this formula to the case of irreducible representations, particularly for multiple loop quivers.
• To re-derive and confirm the linear term in the q-expansion of the counting polynomial using λ-ring methods.
• To conjecture that all Taylor coefficients of the counting polynomials around q=1 are nonnegative, suggesting deeper geometric structure.

Proposed method

• The authors combine λ-ring techniques from [8] with Hall algebra methods from [12] to derive a generating function formula.
• They use Adams operations ψ_n(f) = f(q^n, x_1^n, ..., x_r^n) to define λ-ring structures on power series rings over Q(q).
• The Exp and Log maps on the λ-ring are used to relate generating functions, with Log defined via the Möbius function and ψ_k operations.
• A recursive formula is derived using the relation g * S_{-Rα}p = 0, where p is a generating series and R is the Cartan matrix.
• The method leverages the identity p(−Rα) · g / p = 0 to recursively determine the generating function g.
• The formula is specialized to the m-loop quiver case, where the generating function is shown to satisfy Exp((a(q)−x)/(1−q))|_{q=1} = 1−mx.

Experimental results

Research questions

• RQ1 Can a non-recursive formula be derived for the generating function of polynomials counting absolutely stable quiver representations over finite fields?
• RQ2 What is the precise form of the generating function for irreducible representations in the case of multiple loop quivers?
• RQ3 Are the Taylor coefficients of the counting polynomials around q=1 nonnegative, and what geometric meaning might they have?
• RQ4 Can the linear term in the q-expansion of the counting polynomial be re-derived using λ-ring techniques?
• RQ5 Is there a combinatorial or geometric interpretation for the nonnegativity of the coefficients in the expansion of the counting polynomials at q=1?

Key findings

• The generating function for absolutely stable quiver representations is given by a closed-form expression involving Exp and Log maps on λ-rings, simplifying the recursive formula from [12].
• For the m-loop quiver, the generating function satisfies Exp((a(q)−x)/(1−q))|_{q=1} = 1−mx, which implies the linear term is ∑_{k|d} μ(d/k) m^k / d.
• This linear term matches the number of primitive necklaces of length d with m colors, confirming a known combinatorial result.
• The constant term of the counting polynomial a_d(q) is zero for d ≥ 2, and the linear term is nonnegative, as verified by computer experiments.
• The paper conjectures that a_d(q) ∈ ℕ[q−1], meaning all Taylor coefficients at q=1 are nonnegative integers.
• Further computer experiments suggest f_n(m,t) · (1−mt)^{3n−1} is a polynomial in m and t of degree 3n−1, supporting deeper structure in the expansion.