arXiv Analytics

Sign in

arXiv:1807.10217 [math.RT]AbstractReferencesReviewsResources

Combinatorics of Fourier transforms for type A quiver representations

Pramod N. Achar, Maitreyee C. Kulkarni, Jacob P. Matherne

Published 2018-07-26Version 1

We describe two new combinatorial algorithms (using the language of "triangular arrays") for computing the Fourier transforms of simple perverse sheaves on the moduli space of representations of an equioriented quiver of type A. (A rather different solution to this problem was previously obtained by Knight-Zelevinsky.) Along the way, we also show that the closure partial order and the dimensions of orbits have especially concise descriptions in the language of triangular arrays.

Comments: 24 pages, 2 figures
Categories: math.RT, math.CO
Subjects: 16G20, 05E10
Related articles: Most relevant | Search more
arXiv:1506.08927 [math.RT] (Published 2015-06-30)
Combinatorics of exceptional sequences in type A
arXiv:2004.08033 [math.RT] (Published 2020-04-17)
Combinatorics of Type D Exceptional Sequences
arXiv:math/0608288 [math.RT] (Published 2006-08-11, updated 2007-08-31)
The Combinatorics of Quiver Representations