2000 character limit reached
Level Two String Functions and Rogers Ramanujan Type Identities (1405.1387v1)
Published 6 May 2014 in hep-th, math-ph, and math.MP
Abstract: The level two string functions are calculated exactly for all simply laced Lie algebras, using a ladder coset construction. These are the characters of cosets of the type $G/U(1)r$, where $G$ is the algebra at level two and $r$ is its rank. This coset is a theory of generalized parafermions. A conjectured Rogers Ramanujan type identity is described for these characters. Using the exact string functions, we verify the Rogers Ramanujan type expressions, that are the main focus of this work.
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.