Papers
Topics
Authors
Recent
Search
2000 character limit reached

Quivers with loops and Lagrangian subvarieties

Published 21 Nov 2013 in math.RT | (1311.5396v4)

Abstract: In this article we define a generalization of Lusztig Lagrangian varieties in the case of arbitrary quivers, possibly carrying loops. As opposed to the Lagrangian varieties constructed by Lusztig, which consisted in nilpotent representations, we have to consider here slightly more general representations. That this is necessary is already clear from the Jordan quiver case. Our proof of the Lagrangian character is based on induction, but with non trivial first steps, consisting in the study of quivers with one vertex but possible loops. From our proof emerges a new combinatorial structure on the set of irreducible components, which is more general than the usual crystals, in that there are now more operators associated to a vertex with loops. We finally consider a convolution algebra of constructible functions on our varieties, and construct a family of constructible functions naturally attached to the irreducible components.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.