1995
DOI: 10.1142/s0217751x95000437
|View full text |Cite
|
Sign up to set email alerts
|

On State Counting and Characters

Abstract: We outline the relationship between the thermodynamic densities and quasi-particle descriptions of spectra of RSOS models with an underlying Bethe equation. We use this to prove completeness of states in some cases and then give an algorithm for the construction of branching functions of their emergent conformal field theories. Starting from the Bethe equations of D n type, we discuss some aspects of the Z n lattice models. 4/94

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

1996
1996
2005
2005

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(9 citation statements)
references
References 30 publications
0
9
0
Order By: Relevance
“…Signs of an even stronger connection were found by Melzer [10], who conjectured that finitizations of the fermionic character expressions, originating from TBA for the finitized ABF model, equal finitizations of the bosonic character expressions originating from CTM for the finitized ABF model. It has especially been this last result and its many generalizations to other solvable models [18][19][20][21][22][23][24][25][26], that has motivated our attempt to unify TBA and CTM approaches to solvable models.…”
Section: Introductionmentioning
confidence: 99%
“…Signs of an even stronger connection were found by Melzer [10], who conjectured that finitizations of the fermionic character expressions, originating from TBA for the finitized ABF model, equal finitizations of the bosonic character expressions originating from CTM for the finitized ABF model. It has especially been this last result and its many generalizations to other solvable models [18][19][20][21][22][23][24][25][26], that has motivated our attempt to unify TBA and CTM approaches to solvable models.…”
Section: Introductionmentioning
confidence: 99%
“…For the reason of conciseness we refer readers to [8] (in this conference) for some ground information about string configuration, and like previously we will continue with the notation established there. As we told earlier there is a bijection between paths and standard Young tableaux, and between standard Young tableaux and rigged configurations [2,4], as well. This fact implies the bijection between paths and rigged configuration [4].…”
Section: Bijection Between Paths and Stringsmentioning
confidence: 94%
“…As we told earlier there is a bijection between paths and standard Young tableaux, and between standard Young tableaux and rigged configurations [2,4], as well. This fact implies the bijection between paths and rigged configuration [4]. Lets restrict ourselfs to the case n = 2.…”
Section: Bijection Between Paths and Stringsmentioning
confidence: 94%
See 2 more Smart Citations