Papers
Topics
Authors
Recent
Search
2000 character limit reached

Level Two String Functions and Rogers Ramanujan Type Identities

Published 6 May 2014 in hep-th, math-ph, and math.MP | (1405.1387v1)

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.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.