Card shuffling and the decomposition of tensor products

Details Card shuffling and the decomposition of tensor products Card shuffling and the decomposition of tensor products

2003-07-03

arxiv.org/abs/math/0307053v1

Mathematics

Representation Theory

Scientific paper

Let H be a subgroup of a finite group G. We use Markov chains to quantify how large r should be so that the decomposition of the r tensor power of the representation of G on cosets on H behaves (after renormalization) like the regular representation of G. For the case where G is a symmetric group and H a parabolic subgroup, we find that this question is precisely equivalent to the question of how large r should be so that r iterations of a shuffling method randomize the Robinson-Schensted-Knuth shape of a permutation. This equivalence is rather remarkable, if only because the representation theory problem is related to a reversible Markov chain on the set of representations of the symmetric group, whereas the card shuffling problem is related to a nonreversible Markov chain on the symmetric group. The equivalence is also useful, and results on card shuffling can be applied to yield sharp results about the decomposition of tensor powers.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-655283