Recursive algorithm and branching for nonmaximal embeddings

Details Recursive algorithm and branching for nonmaximal embeddings Recursive algorithm and branching for nonmaximal embeddings

2010-07-02

arxiv.org/abs/1007.0318v2

J. Phys. A 44:075205,2011

Mathematics

Representation Theory

LaTeX, 23 pages, 13 figures, section 2 is clarified, new lemma and theorem are introduced, figures are improved, submitted to

Scientific paper

10.1088/1751-8113/44/7/075205

Recurrent relations for branching coefficients in affine Lie algebras integrable highest weight modules are studied. The decomposition algorithm based on the injection fan technique is developed for the case of an arbitrary reductive subalgebra. In particular we consider the situation where the Weyl denominator becomes singular with respect to the subalgebra. We demonstrate that for any reductive subalgebra it is possible to define the injection fan and the analogue of the Weyl numerator - the tools that describe explicitly the recurrent properties of branching coefficients. Possible applications of the fan technique in CFT models are considered.

Affiliated with

Also associated with

No associations

Rating

Recursive algorithm and branching for nonmaximal embeddings 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 Recursive algorithm and branching for nonmaximal embeddings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Recursive algorithm and branching for nonmaximal embeddings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-727429