Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Quivers with loops and Lagrangian subvarieties (1311.5396v4)

Published 21 Nov 2013 in math.RT

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

We haven't generated a summary for this paper yet.