Combinatorial wall-crossing for the sign representation of prime size
From MaRDI portal
(Redirected from Combinatorial wall-crossing for the sign representation of prime size)
Abstract: We present an algorithm to calculate the result of combinatorial wall-crossing at every step starting with the column partition of prime size. This algorithm is confirmed by computer calculations. The output of the algorithm is consistent with Bezrukavnikov's conjecture in the case of the sign representation.
This page was built for publication: Combinatorial wall-crossing for the sign representation of prime size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6428555)
