Quivers, invariants and quotient correspondence (Q2438393)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Quivers, invariants and quotient correspondence
scientific article

    Statements

    Quivers, invariants and quotient correspondence (English)
    0 references
    0 references
    0 references
    11 March 2014
    0 references
    A quiver \(Q\) is a directed graph having a finite number of vertices \(V\), a set of arrows \(A\), and two functions \(h,t:A\to V\). Any image of \(h\) is called the \textit{head} of the corresponding arrow, likewise any image of \(t\) is called a \textit{tail}. \(Q\) is said to be of \textit{ladder type} if \(V\) is the disjoint union of a set of heads \(H\) with a set of tails \(T\). With respect to a fixed dimension vector for \(Q\) (assigning to each vertex a natural number), there is a product of general linear groups with respect to \(H\) (denoted by \(G_H\)) and also with respect to \(T\) (denoted by \(G_T\)). The author likewise defines products of Grassmannians \(X_T\) and \(X_H\) where \(G_H\) and \(G_T\) respectively act. The main theorem of this paper states that the set of GIT quotients of \(X_T\) by \(G_H\) and the set of GIT quotients of \(X_H\) by \(G_T\) are in one-to-one correspondence. The proof comes down to the observation that the moduli space of representations of \(Q\), since \(Q\) is of ladder type, can be obtained by first taking a quotient by \(G_H\) resulting in \(X_H\) and then by \(G_T\), or by first taking the quotient by \(G_T\) resulting in \(X_T\) and then by \(G_H\). Later a similar theorem is described with respect to parabolic subgroups of the general linear group and with Grassmannians replaced by flag varieties. The remainder of the paper is devoted to algebraic and representation theoretic interpretations of these geometric results.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    GIT quotients
    0 references
    quotient correspondences
    0 references
    representation theory
    0 references
    branching rules
    0 references
    0 references
    0 references