Upper bound on the characters of the symmetric groups for balanced Young diagrams and a generalized Frobenius formula

Details Upper bound on the characters of the symmetric groups for balanced Young diagrams and a generalized Frobenius formula Upper bound on the characters of the symmetric groups for balanced Young diagrams and a generalized Frobenius formula

2006-10-18

arxiv.org/abs/math/0610540v2

Advances in Mathematics 218 (2008) 673-695

Mathematics

Representation Theory

26 pages

Scientific paper

10.1016/j.aim.2008.01.008

We study asymptotics of an irreducible representation of the symmetric group S_n corresponding to a balanced Young diagram \lambda (a Young diagram with at most C\sqrt{n} rows and columns for some fixed constant C) in the limit as n tends to infinity. We show that there exists a constant D (which depends only on C) with a property that |\chi^{\lambda}(\pi)| = | Tr \rho^{\lambda}(\pi)/Tr \rho^{\lambda}(e) | < [ D max(1,|\pi|^2/n) / \sqrt{n}} ]^{|\pi|}, where |\pi| denotes the length of a permutation (the minimal number of factors necessary to write \pi as a product of transpositions). Our main tool is an analogue of Frobenius character formula which holds true not only for cycles but for arbitrary permutations.

Affiliated with

Also associated with

No associations

Rating

Upper bound on the characters of the symmetric groups for balanced Young diagrams and a generalized Frobenius formula 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 Upper bound on the characters of the symmetric groups for balanced Young diagrams and a generalized Frobenius formula, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Upper bound on the characters of the symmetric groups for balanced Young diagrams and a generalized Frobenius formula will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-99797