Geometric analysis on small unitary representations of GL(N,R)

Mathematics – Representation Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Corrections of the previous version

Scientific paper

10.1016/j.jfa.2010.12.008.

The most degenerate unitary principal series representations {\pi}_{i{\lambda},{\delta}} (with {\lambda} \in R, \delta \in Z/2Z) of G = GL(N,R) attain the minimum of the Gelfand-Kirillov dimension among all irreducible unitary representations of G. This article gives an explicit formula of the irreducible decomposition of the restriction {\pi}_{i{\lambda},{\delta}}|_H (branching law) with respect to all symmetric pairs (G,H). For N=2n with n \geq 2, the restriction {\pi}_{i{\lambda},{\delta}}|_H remains irreducible for H=Sp(n,R) if {\lambda}\neq0 and splits into two irreducible representations if {\lambda}=0. The branching law of the restriction {\pi}_{i{\lambda},{\delta}}|_H is purely discrete for H = GL(n,C), consists only of continuous spectrum for H = GL(p,R) \times GL(q,R) (p+q=N), and contains both discrete and continuous spectra for H=O(p,q) (p>q\geq1). Our emphasis is laid on geometric analysis, which arises from the restriction of `small representations' to various subgroups.

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

Geometric analysis on small unitary representations of GL(N,R) 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 Geometric analysis on small unitary representations of GL(N,R), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Geometric analysis on small unitary representations of GL(N,R) will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-597900

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