Chess tableaux are a special kind of standard Young tableaux where, in the chessboard coloring of the Young diagram, even numbers always appear in white cells and odd numbers in black cells. If, for a partition of , denotes the number of chess tableaux of shape , then Chow, Eriksson and Fan observed that is divisible by unusually large powers of . In this paper, we give an explanation for this phenomenon, proving a lower bound of for the -adic valuation of this sum and a generalization of it. We do this by exploiting a connection with a certain representation of the affine Lie algebra on the vector space with basis indexed by partitions. Our result about chess tableaux then follows from a study of the basic representation of with coefficients taken from the ring of rational numbers with odd denominators.

生成讲解博客的中文版本

生成AI智能校验的中文版本