Related papers: Asymptotics of Jack characters
We give a complete list of indecomposable characters of the infinite symmetric semigroup. In comparison with the analogous list for the infinite symmetric group, one should introduce only one new parameter, which has a clear combinatorial…
We develop a new method for studying the asymptotics of symmetric polynomials of representation-theoretic origin as the number of variables tends to infinity. Several applications of our method are presented: We prove a number of theorems…
We construct a generalization of the theory of symmetric functions involving functions of commuting and anticommuting (Grassmannian) variables. These new functions, called symmetric functions in superspace, are invariant under the diagonal…
We derive an asymptotic expansion for the subgroup of arbitrary Fuchsian groups and some other classes of large groups. Moreover, the main conjecture for Random Walks on symmetric groups is established in full generality. Both problems…
We present a positivity conjecture for the coefficients of the development of Jack polynomials in terms of power sums. This extends Stanley's ex-conjecture about normalized characters of the symmetric group. We prove this conjecture for…
The algebraic properties of formal power series, whose coefficients show factorial growth and admit a certain well-behaved asymptotic expansion, are discussed. It is shown that these series form a subring of $\mathbb{R}[[x]]$. This subring…
We prove an identity about partitions involving new combinatorial coefficients. The proof given is using a generating function. As an application we obtain the explicit expression of two shifted symmetric functions, related with Jack…
We give an explicit formula for the power-sum expansion of Jack polynomials. We deduce it from a more general formula, which we provide here, that interprets Jack characters in terms of bipartite maps. We prove Lassalle's conjecture from…
Representation theory of finite groups portrays a marvelous crossroad of group theory, algebraic combinatorics, and probability. In particular the Plancherel measure is a probability that arises naturally from representation theory, and in…
We develop the general theory of Jack-Laurent symmetric functions, which are certain generalisations of the Jack symmetric functions, depending on an additional parameter p_0.
Asymptotic approximations of Jacobi polynomials are given in terms of elementary functions for large degree $n$ and parameters $\alpha$ and $\beta$. From these new results, asymptotic expansions of the zeros are derived and methods are…
We study the asymptotic behavior of two statistics defined on the symmetric group S_n when n tends to infinity: the number of elements of S_n having k records, and the number of elements of S_n for which the sum of the positions of their…
We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…
In this paper we consider asymptotic expansions for a class of sequences of symmetric functions of many variables. Applications to classical and free probability theory are discussed.
Snakes are analogues of alternating permutations defined for any Coxeter group. We study these objects from the point of view of combinatorial Hopf algebras, such as noncommutative symmetric functions and their generalizations. The main…
We study the questions of determining the asymptotics of the probabilistic characteristics of additive arithmetic functions in the paper, regardless of whether they have a limit distribution or not. Several assertions are proved about the…
We study asymptotics of characters of the symmetric groups on a fixed conjugacy class. It was proved by Kerov that such a character can be expressed as a polynomial in free cumulants of the Young diagram (certain functionals describing the…
Block character of a finite symmetric group S(n) is a positive definite function which depends only on the number of cycles in permutation. We describe the cone of block characters by identifying its extreme rays, and find relations of the…
The irreducible characters of the symmetric group are a symmetric polynomial in the eigenvalues of a permutation matrix. They can therefore be realized as a symmetric function that can be evaluated at a set of variables and form a basis of…
We compute the number of ways a given permutation can be written as a product of exactly $k$ transpositions. We express this number as a linear combination of explicit geometric sequences, with coefficients which can be computed in many…