Morita equivalences between cyclotomic KLR algebras in types \(C_{\infty}\) and \(A_{\infty}\) (Q7315150)

The paper establishes a graded Morita equivalence between level one cyclotomic Khovanov-Lauda-Rouquier algebras of type \(C_\infty\) and level two cyclotomic KLR algebras of type \(A_\infty\). The equivalence is constructed explicitly by considering an idempotent truncation of a level one type \(C_\infty\) algebra. If \(\rho\) is the rectangular partition which is the unique partition in the corresponding defect zero block, the authors construct a graded algebra isomorphism between this truncation and the tensor product of the type \(C_\infty\) algebra associated with \(\rho\) and a suitable level two cyclotomic KLR algebra of type \(A_\infty\). They also show that the truncation is graded Morita equivalent to the original type \(C_\infty\) algebra and that the equivalence preserves the cellular structure.\N\NThe main result gives an explicit description of the induced correspondence on simple and Specht modules. More precisely, if \((\lambda,\mu)\) is a bipartition indexing a level two type \(A_\infty\) Specht module, then the corresponding level one type \(C_\infty\) Specht module is indexed by \(\rho+(\lambda,\mu')\) and the same combinatorial correspondence holds for the associated simple modules. It follows in particular that the graded decomposition matrices are preserved under the Morita equivalence.\N\NAs a consequence, the graded decomposition matrices of level one cyclotomic KLR algebras of type \(C_\infty\) are characteristic-free and are given by anti-spherical \((p\text{-})\)Kazhdan-Lusztig polynomials for maximal finite parabolic subgroups of finite symmetric groups. In particular, their graded decomposition numbers agree with the canonical basis coefficients for the type \(C_\infty\) highest weight irreducible module in every characteristic. The results also yield the full submodule structures of the level one type \(C_\infty\) Specht modules; these can be described in terms of strong Alperin diagrams.