2000 character limit reached
Young Walls of Type $D^(2)_n+1$ and Strict Partitions (1105.2380v2)
Published 12 May 2011 in math.RT and math.QA
Abstract: We show that the number of reduced Young walls of type $D_{n+1}{(2)}$ with $m$ blocks is independent of $n$ and the same as the number of strict partitions of $m$. Thus the principally specialized character $\chi_n{\Lambda_0}(t)$ of $V(\Lambda_0)$ over $U_q(D_{n+1}{(2)})$ can be interpreted as a generating function for strict partitions. Hence we obtain an infinite family of generalizations of Euler's partition identity.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.