Asymptotics of characters of symmetric groups related to Stanley character formula
By Valentin F'eray, Piotr Śniady. 2007
63 citations recorded by the source corpus.
We prove an upper bound for characters of the symmetric groups. In particular, we show that there exists a constant a > 0 with a property that for every Young diagram with n boxes, r( ) rows and c( ) columns Tr ( ) Tr (e) i amax A r( ) n ; c( ) n ; j j n aoj j ; where j j is the minimal number of factors needed to write 2 Sn as a product of transpositions. We also give uniform estimates for the error term in the Vershik-Kerov’s and Biane’s character formulas and give a new formula for free cumulants of the transition measure.
Subfields: Discrete Mathematics and Combinatorics, Mathematical Physics
View Paper: https://www.semanticscholar.org/paper/59e80b672ece87677b52f8878518f6a81ba21acb
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Discrete Mathematics and Combinatorics
In Mathematical Physics
Citations in the corpus
- Free Probability and Random Matrices (2014, background): “So we are, for example, not addressing such exciting topics as free stochastic and Malliavin calculus [40, 108, 114], or the rectangular version of free probability [28], or the strong version of asymptotic freeness [48, 58, 89], or free monotone transport [83], or the relation with representation t”