I will use the formula on the top of page 35 from Nakajima’s “Quiver Varieties and Branching”:
;
.
Where the first “t” in the second equation indicates transposing (according to the process described on page 33) the generalized young diagram and the second “t” is given by the formula (on page 34):
.
are suitable choices for “d” and “
” in affine
(which in this case is on “both sides” of the level-rank duality).
And is (I believe) the coefficient of M in the formula for d(M) found near the bottom of page 32.
My goal is to find the cycles corresponding to the first two triangles in my list of polytopes so I use:
Some of the notation is very confusing, I understand. I’m sorry, I don’t know what to do with it: at the end of the day the dimension vectors we are concerned about are and
We want to replace the arrows in this diagram with maps (in order of appearance top to bottom left to right) in such a way that it satisfies three conditions which I abbreviate as the “
” (this is not the same
… sorry), “stability” and “limit” conditions.
The “” condition in our case (for and for other choices of
but still r=l=2) implies:
The “Stability” condition has two halves. First that every vector v in the top half has “Origins” i.e. where
live in the bottom half and
are chosen from appropriate paths in the quiver. And second that every non-zero v in the top half has “Futures” i.e.
for some path g terminating in the bottom half.
The “Limit” condition requires that the action of t (not the same as either previous t… sorry) given on page 30 can be “controled” as by action of
described on page 5 (just before eq. 2.1 )
Something to notice right away because it will be useful in future calculations: taking the two halves of “Stability” together gives paths on which
has no control! The “Limit” condition requires that the image of such a composition must lie in
. (Superscript refers to the decomposition into 1-dimensional subspaces given by
— use of the
is short hand for the corresponding filtration.)
In our case we have . For example if the image of
is non-zero the "Futures" condition says it must escape but, according to the "Limit" condition, in doing so it can only afford to accumulate
orders of t and every possible exiting accumulates at least
. The argument for
is quite similar replacing "image" with "kernel", "Futures" with "Origins" etc..
Furthermore we get:
,
and
.
(Moding out by the action in this case we can assume
The two components, then, correspond to diagrams:
and
Where the solid line indicates the map is non-zero and dashed line indicates the map may be zero.