Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Rational CFT With Three Characters: The Quasi-Character Approach (2002.01949v2)

Published 5 Feb 2020 in hep-th, cond-mat.str-el, math-ph, math.MP, and math.NT

Abstract: Quasi-characters are vector-valued modular functions having an integral, but not necessarily positive, q-expansion. Using modular differential equations, a complete classification has been provided in arXiv:1810.09472 for the case of two characters. These in turn generate all possible admissible characters, of arbitrary Wronskian index, in order two. Here we initiate a study of the three-character case. We conjecture several infinite families of quasi-characters and show in examples that their linear combinations an generate admissible characters with arbitrarily large Wronskian index. The structure is completely different from the order two case, and the novel coset construction of arXiv:1602.01022 plays a key role in discovering the appropriate families. Using even unimodular lattices, we construct some explicit three-character CFT corresponding to the new admissible characters.

Citations (19)

Summary

We haven't generated a summary for this paper yet.