2000 character limit reached
Quiver varieties and root multiplicities in rank 3 (2508.04804v1)
Published 6 Aug 2025 in math.RT
Abstract: Building on our previous work in rank two, we use quiver varieties to give a combinatorial upper bound on dimensions of certain imaginary root spaces for rank 3 symmetric Kac-Moody algebras. We describe an explicit method for extracting combinatorics when the Dynkin diagram is bipartite (i.e. two of the nodes are not connected). As in rank two we believe these bounds are quite tight and we give computational evidence to this effect, although there is more error in rank 3 than in rank 2.