English

The Andrews-Olsson identity and Bessenrodt insertion algorithm on Young walls

Combinatorics 2014-07-31 v2 Representation Theory

Abstract

We extend the Andrews-Olsson identity to two-colored partitions. Regarding the sets of proper Young walls of quantum affine algebras \gn=A2n(2)\g_n=A^{(2)}_{2n}, A2n1(2)A^{(2)}_{2n-1}, Bn(1)B^{(1)}_{n}, Dn(1)D^{(1)}_{n} and Dn+1(2)D^{(2)}_{n+1} as the sets of two-colored partitions, the extended Andrews-Olsson identity implies that the generating functions of the sets of reduced Young walls have very simple formulae: \begin{center} i=1(1+ti)κi\prod^{\infty}_{i=1}(1+t^i)^{\kappa_i} where κi=0\kappa_i=0, 11 or 22, and κi\kappa_i varies periodically. \end{center} Moreover, we generalize the Bessenrodt's algorithms to prove the extended Andrews-Olsson identity in an alternative way. From these algorithms, we can give crystal structures on certain subsets of pair of strict partitions which are isomorphic to the crystal bases B(Λ)B(\Lambda) of the level 11 highest weight modules V(Λ)V(\Lambda) over Uq(\gn)U_q(\g_n).

Keywords

Cite

@article{arxiv.1212.5986,
  title  = {The Andrews-Olsson identity and Bessenrodt insertion algorithm on Young walls},
  author = {Se-jin Oh},
  journal= {arXiv preprint arXiv:1212.5986},
  year   = {2014}
}

Comments

This is final version which will be published in European Journal of Combinatorics (2015), pp. 8-31

R2 v1 2026-06-21T22:59:55.718Z