2007
DOI: 10.4310/atmp.2007.v11.n6.a2
|View full text |Cite
|
Sign up to set email alerts
|

Characters of graded parafermion conformal field theory

Abstract: Abstract. The graded parafermion conformal field theory at level k is a close cousin of the much-studied Z k parafermion model. Three character formulas for the graded parafermion theory are presented, one bosonic, one fermionic (both previously known) and one of spinon type (which is new). The main result of this paper is a proof of the equivalence of these three forms using q-series methods combined with the combinatorics of lattice paths. The pivotal step in our approach is the observation that the graded p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
13
0

Year Published

2007
2007
2018
2018

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(14 citation statements)
references
References 30 publications
(54 reference statements)
1
13
0
Order By: Relevance
“…Our formula is the standard one, given in[37]. It also agrees with[40,41] For equivalent, but different-looking, expressions, see[42,43].…”
supporting
confidence: 81%
“…Our formula is the standard one, given in[37]. It also agrees with[40,41] For equivalent, but different-looking, expressions, see[42,43].…”
supporting
confidence: 81%
“…As before, the chiral algebra A 1 for the (A 1 , A 2n+1 ) model is generated by the upper triangular SU(2n + 1) currents at level 1. Moreover, according to Fortin et al [60] this is given by the character of Sp(2n) at level 1.…”
Section: Jhep11(2017)013mentioning
confidence: 99%
“…Consider thus its associated multiple partition and use the exchange relation to move the cluster n (j) m j to the far right in order to reach its lowest allowed weight. It is thus displaced through all clusters of larger charge by means of the exchange relation (36). This reduces its weight to n (j) m j − 2j(m j+1 + · · · + m k−1 ).…”
Section: From Paths To Multiple Partitionsmentioning
confidence: 99%
“…1 · · · n (j) ℓ · · · n (k−1) m k−1 . Each cluster is then inserted successively (starting with n (2) 1 up to n (k−1) m k−1 ) within the partition, using the interchange rule (36), treating again each part as a cluster of charge 1. Once inserted within the partition (at a position subject to criteria to be specified), a cluster is unfolded into the number of parts given by its charge, with parts as equal as possible.…”
Section: From Multiple Partitions To Restricted Partitionsmentioning
confidence: 99%
See 1 more Smart Citation