Related papers: Asymptotic results for Representation Theory
Many aspects of the asymptotics of Plancherel distributed partitions have been studied in the past fifty years, in particular the limit shape, the distribution of the longest rows, connections with random matrix theory and characters of the…
In this paper we study the asymptotic of multiplicities of irreducible representations in large tensor products of finite dimensional representations of simple Lie algebras and their statistics with respect to Plancherel and character…
In this thesis, we investigate the asymptotics of random partitions chosen according to probability measures coming from the representation theory of the symmetric groups $S_n$ and of the finite Chevalley groups $GL(n,F_q)$ and…
In recent years increasing attention has been paid on the area of supercharacter theories, especially to those of the upper unitriangular group. A particular supercharacter theory, in which supercharacters are indexed by set partitions, has…
We introduce the Plancherel measure on the set of partition collections, which parameterize irreducible representations of order n general linear group over a finite field. We prove that as n goes to infinity, the random partitions from the…
The article presents the results of experiments in computation of statistical values related to Young diagrams, including the estimates on maximum and average (by Plancherel distribution) dimension of irreducible representation of symmetric…
We study the asymptotic behaviour of random integer partitions under a new probability law that we introduce, the Plancherel-Hurwitz measure. This distribution, which has a natural definition in terms of Young tableaux, is a deformation of…
We prove a factorization-concentration result for characters of symmetric groups. This is then applied to the asymptotic behaviour of the decomposition of the tensor representations. There are connections with the Pastur-Marcenko…
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 study asymptotics of reducible representations of the symmetric groups S_q for large q. We decompose such a representation as a sum of irreducible components (or, alternatively, Young diagrams) and we ask what is the character of a…
We initiate a Stein's method approach to the study of the Plancherel measure of the symmetric group. A new proof of Kerov's central limit theorem for character ratios of random representations of the symmetric group on transpositions is…
We define the $L$-measure on the set of Dirichlet characters as an analogue of the Plancherel measure, once considered as a measure on the irreducible characters of the symmetric group. We compare the two measures and study the limit in…
We consider the asymptotics of the Plancherel measures on partitions of $n$ as $n$ goes to infinity. We prove that the local structure of a Plancherel typical partition (which we identify with a Young diagram) in the middle of the limit…
We study two types of probability measures on the set of integer partitions of $n$ with at most $m$ parts. The first one chooses the random partition with a chance related to its largest part only. We then obtain the limiting distributions…
We consider three uniqueness theorems: one from the theory of meromorphic functions, another one from asymptotic combinatorics, and the third one about representations of the infinite symmetric group. The first theorem establishes the…
Symmetry is a cornerstone of much of mathematics, and many probability distributions possess symmetries characterized by their invariance to a collection of group actions. Thus, many mathematical and statistical methods rely on such…
We relate the linear asymptotic representation theory of the symmetric groups to its spin counterpart. In particular, we give explicit formulas which express the normalized irreducible spin characters evaluated on a strict partition $\xi$…
We study asymptotics of random shifted Young diagrams which correspond to a given sequence of reducible projective representations of the symmetric groups. We show limit results (Law of Large Numbers and Central Limit Theorem) for their…
Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…
Random walk on the set of irreducible representations of a finite group is investigated. For the symmetric and general linear groups, a sharp convergence rate bound is obtained and a cutoff phenomenon is proved. As related results, an…