Tensor products of strongly graded vertex algebras and their modules

Mathematics – Quantum Algebra

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

26 pages

Scientific paper

We study strongly graded vertex algebras and their strongly graded modules, which are conformal vertex algebras and their modules with a second, compatible grading by an abelian group satisfying certain grading restriction conditions. We consider a tensor product of strongly graded vertex algebras and its tensor product strongly graded modules. We prove that a tensor product of strongly graded irreducible modules for a tensor product of strongly graded vertex algebras is irreducible, and that such irreducible modules, up to equivalence, exhaust certain naturally defined strongly graded irreducible modules for a tensor product of strongly graded vertex algebras. We also prove that certain naturally defined strongly graded modules for the tensor product strongly graded vertex algebra are completely reducible if and only if every strongly graded module for each of the tensor product factors is completely reducible. These results generalize the corresponding known results for vertex operator algebras and their modules.

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

Tensor products of strongly graded vertex algebras and their 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 Tensor products of strongly graded vertex algebras and their modules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tensor products of strongly graded vertex algebras and their modules will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-610394

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