Gaussian fluctuations of representations of wreath products

Mathematics – Representation Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

19 pages

Scientific paper

10.1142/S0219025706002524

We study the asymptotics of the reducible representations of the wreath products G\wr S_q=G^q \rtimes S_q for large q, where G is a fixed finite group and S_q is the symmetric group in q elements; in particular for G=Z/2Z we recover the hyperoctahedral groups. We decompose such a reducible representation of G\wr S_q as a sum of irreducible components (or, equivalently, as a collection of tuples of Young diagrams) and we ask what is the character of a randomly chosen component (or, what are the shapes of Young diagrams in a randomly chosen tuple). Our main result is that for a large class of representations the fluctuations of characters (and fluctuations of the shape of the Young diagrams) are asymptotically Gaussian. The considered class consists of the representations for which the characters asymptotically almost factorize and it includes, among others, the left regular representation therefore we prove the analogue of Kerov's central limit theorem for wreath products.

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

Gaussian fluctuations of representations of wreath products 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 Gaussian fluctuations of representations of wreath products, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Gaussian fluctuations of representations of wreath products will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-591338

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