Pathspace Decompositions for the Virasoro Algebra and its Verma Modules

Physics – High Energy Physics – High Energy Physics - Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

19 pages, LaTeX, BONN TH-94-05

Scientific paper

Starting from a detailed analysis of the structure of pathspaces of the ${\cal A}$-fusion graphs and the corresponding irreducible Virasoro algebra quotients $V(c,h)$ for the ($2,q$ odd) models, we introduce the notion of an admissible pathspace representation. The pathspaces ${\cal P_A}$ over the ${\cal A}$-Graphs are isomorphic to the pathspaces over Coxeter $A$-graphs that appear in FB models. We give explicit construction algorithms for admissible representations. From the finitedimensional results of these algorithms we derive a decomposition of $V(c,h)$ into its positive and negative definite subspaces w.r.t. the Shapovalov form and the corresponding signature characters. Finally, we treat the Virasoro operation on the lattice induced by admissible representations adopting a particle point of view. We use this analysis to decompose the Virasoro algebra generators themselves. This decomposition also takes the nonunitarity of the ($2,q$) models into account.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Pathspace Decompositions for the Virasoro Algebra and its Verma Modules does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pathspace Decompositions for the Virasoro Algebra and its Verma Modules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pathspace Decompositions for the Virasoro Algebra and its Verma Modules will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-24009

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.