Valentin Féray

Learn More
Free cumulants are nice and useful functionals of the shape of a Young diagram, in particular they give the asymptotics of normalized characters of symmetric groups S(n) in the limit n → ∞. We give an explicit combinatorial formula for normalized characters of the symmetric groups in terms of free cumulants. We also express characters in terms of Frobenius(More)
Kerov's polynomials give irreducible character values of the symmetric group in term of the free cumulants of the associated Young diagram. Using a combinatorial approach with maps, we prove in this article a positivity result on their coefficients, which extends a conjecture of S. Kerov. Résumé. Les polynômes de Kerov expriment les valeurs des caractères(More)
We find an explicit combinatorial interpretation of the coefficients of Kerov character polynomials which express the value of normalized irreducible characters of the symmetric groups S(n) in terms of free cumulants R 2 , R 3 ,. .. of the corresponding Young diagram. Our interpretation is based on counting certain factorizations of a given permutation .
We consider a deformation of Kerov character polynomials, linked to Jack symmetric functions. It has been introduced recently by M. Lassalle, who formulated several conjectures on these objects, suggesting some underlying combinatorics. We give a partial result in this direction, showing that some quantities are polynomials in the Jack parameter α with(More)
We consider unicellular maps, or polygon gluings, of fixed genus. A few years ago the first author gave a recursive bijection transforming unicel-lular maps into trees, explaining the presence of Catalan numbers in counting formulas for these objects. In this paper, we give another bijection that explicitly describes the " recursive part " of the first(More)
In this paper, we are interested in the asymptotic size of the rows and columns of a random Young diagram under a natural deformation of the Plancherel measure coming from Hecke algebras. The first lines of such diagrams are typically of order n, so it does not fit in the context of the work of P. Biane and P. ´ Sniady. Using the theory of polynomial(More)
We look at the number of permutations β of [N ] with m cycles such that (1 2. .. N)β −1 is a long cycle. These numbers appear as coefficients of linear monomials in Kerov's and Stanley's character polynomials. D. Zagier, using algebraic methods, found an unexpected connection with Stirling numbers of size N + 1. We present the first combinatorial proof of(More)