Multiplicity-free theorems of the restrictions of unitary highest weight modules with respect to reductive symmetric pairs

Mathematics – Representation Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.1007/978-0-8176-4646-2_3

The complex analytic methods have found a wide range of applications in the study of multiplicity-free representations. This article discusses, in particular, its applications to the question of restricting highest weight modules with respect to reductive symmetric pairs. We present a number of multiplicity-free branching theorems that include the multiplicity-free property of some of known results such as the Clebsh--Gordan--Pieri formula for tensor products, the Plancherel theorem for Hermitian symmetric spaces (also for line bundle cases), the Hua--Kostant--Schmid $K$-type formula, and the canonical representations in the sense of Vershik--Gelfand--Graev. Our method works in a uniform manner for both finite and infinite dimensional cases, for both discrete and continuous spectra, and for both classical and exceptional cases.

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

Multiplicity-free theorems of the restrictions of unitary highest weight modules with respect to reductive symmetric pairs 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 Multiplicity-free theorems of the restrictions of unitary highest weight modules with respect to reductive symmetric pairs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiplicity-free theorems of the restrictions of unitary highest weight modules with respect to reductive symmetric pairs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-391466

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