Related papers: Limit shape for regularisation of large partitions…
We review the limit shape problem for the Plancherel measure and its generalizations found in supersymmetric gauge theory instanton count. We focus on the measure, interpolating between the Plancherel measure and uniform measure, a U(1)…
We study large random partitions boxed into a rectangle and coming from skew Howe duality, or alternatively from dual Schur measures. As the sides of the rectangle go to infinity, we obtain: 1) limit shape results for the profiles…
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…
Let $\mathcal{P}_k(n)$ denote the set of partitions of $n$ whose largest part is bounded by $k,$ which are in well-known bijection with $(k+1)$-cores $\mathcal{C}_k$. We study a growth process on $\mathcal{C}_k$, whose stationary…
If a partition $\lambda$ of size n is chosen randomly according to the Plancherel measure $P_n[\lambda] = (\dim \lambda)^2/n!$, then as n goes to infinity, the rescaled shape of $\lambda$ is with high probability very close to a non-random…
In this paper, we are interested in the asymptotic size of 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…
This is an expository note answering a question posed to us by Richard Stanley, in which we prove a limit shape theorem for partitions of $n$ which maximize the number of subpartitions. The limit shape and the growth rate of the number of…
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…
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…
The work of Vershik and Kerov [1977], Logan and Shepp [1977] established that the shape of the scaled random young diagram in Russian notation, as determined by the Plancherel measure, converges to a deterministic shape. In this article, we…
Random skew plane partitions of large size distributed according to an appropriately scaled Schur process develop limit shapes. In the present work we consider the limit of large random skew plane partitions where the inner boundary…
We obtain a new extension of Rogers-Shephard inequality providing an upper bound for the volume of the sum of two convex bodies $K$ and $L$. We also give lower bounds for the volume of the $k$-th limiting convolution body of two convex…
We prove asymptotic 0-1 Laws satisfied by diagrams of unimodal sequences of positive integers. These diagrams consist of columns of squares in the plane, and the upper boundary is called the shape. For various types, we show that, as the…
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…
We give new bounds and asymptotic estimates for Kronecker and Littlewood--Richardson coefficients. Notably, we resolve Stanley's questions on the shape of partitions attaining the largest Kronecker and Littlewood--Richardson coefficients.…
We study edge asymptotics of poissonized Plancherel-type measures on skew Young diagrams (integer partitions). These measures can be seen as generalizations of those studied by Baik--Deift--Johansson and Baik--Rains in resolving Ulam's…
The convex hull peeling of a point set consists in taking the convex hull, then removing the extreme points and iterating that procedure until no point remains. The boundary of each hull is called a layer. Following on from [15], we study…
Several generalizations of Vershik-Kerov limit shape problem are motivated by topological string theory and supersymmetric gauge theory instanton count. In this paper specifically we study the circular and linear quiver theories. We also…
In first-passage percolation on the integer lattice, the Shape Theorem provides precise conditions for convergence of the set of sites reachable within a given time from the origin, once rescaled, to a compact and convex limiting shape.…
A detailed combinatorial analysis of planar convex lattice polygonal lines is presented. This makes it possible to answer an open question of Vershik regarding the existence of a limit shape when the number of vertices is constrained.