2003
DOI: 10.1016/s0550-3213(03)00175-5
|View full text |Cite
|
Sign up to set email alerts
|

Fermionic characters for graded parafermions

Abstract: Fermionic-type character formulae are presented for charged irreducible modules of the graded parafermionic conformal field theory associated to the coset osp(1, 2) k / u(1). This is obtained by counting the weakly ordered 'partitions' subject to the graded Z k exclusion principle. The bosonic form of the characters is also presented. 01/03

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
44
0

Year Published

2004
2004
2009
2009

Publication Types

Select...
7

Relationship

4
3

Authors

Journals

citations
Cited by 13 publications
(44 citation statements)
references
References 11 publications
0
44
0
Order By: Relevance
“…In the following, we trade the pair (i, σi) for (x, y). 3 References [39,38] are early studies of the relation between these generalized RSOS models and the non-unitary minimal models. 4 There is also a simple path description for the M(2, 2k + 1) models but it is not formulated directly in terms of RSOS paths of [21]; it is expressed in terms of a different type of paths, the so-called Bressoud paths [8], to be introduced below.…”
Section: Introductionmentioning
confidence: 99%
“…In the following, we trade the pair (i, σi) for (x, y). 3 References [39,38] are early studies of the relation between these generalized RSOS models and the non-unitary minimal models. 4 There is also a simple path description for the M(2, 2k + 1) models but it is not formulated directly in terms of RSOS paths of [21]; it is expressed in terms of a different type of paths, the so-called Bressoud paths [8], to be introduced below.…”
Section: Introductionmentioning
confidence: 99%
“…5 The relative sign in (11) indicates that ψ 1 and ψ † 1 are mutually fermionic. The one in (13) shows that ψ 1 is not fermionic with respect to itself.…”
mentioning
confidence: 99%
“…Given an overpartition, we put all the overlined parts in one partition and the rest in the other partition. For example, starting with the overpartition (8, 6, 6, 4, 4,4, 2,1), we get (4, 1) and (8,6,6,4,4,2).…”
Section: Combinatorial Setting and Applicationsmentioning
confidence: 99%
“…. ) [4], [6], [14], [18], [22], [23], [24], [27]. First asymptotic and probabilistic results on overpartitions were presented in [11].…”
mentioning
confidence: 99%