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

9Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

We study asymptotics of an irreducible representation of the symmetric group Sn corresponding to a balanced Young diagram λ (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| χλ (π) | = | frac(Tr ρλ (π), Tr ρλ (e)) | ≤ (frac(D max (1, frac(| π |2, n)), sqrt(n)))| π |, where | π | denotes the length of a permutation (the minimal number of factors necessary to write π as a product of transpositions). Our main tool is an analogue of the Frobenius character formula which holds true not only for cycles but for arbitrary permutations. © 2008 Elsevier Inc. All rights reserved.

Cite

CITATION STYLE

APA

Rattan, A., & Śniady, P. (2008). Upper bound on the characters of the symmetric groups for balanced Young diagrams and a generalized Frobenius formula. Advances in Mathematics, 218(3), 673–695. https://doi.org/10.1016/j.aim.2008.01.008

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free