Central Limit Theorem for Random Strict Partitions

We consider the set of all partitions of a number n into distinct summands (the so-called strict partitions) with the uniform distribution on it and study fluctuations of a random partition near its limit shape, for large n. The use of geometrical language allows us to state the problem in terms of the limit behavior of random step functions (Young diagrams). A central limit theorem for such functions is proven. Our method essentially uses the notion of large canonical ensemble of partitions. Bibliography: 7 titles.     

Modeling of an Asymptotically Central Markov Process on 3D Young Graph

The paper discusses the asymptotics of path probabilities in Markov processes close to a central one on 3D Young graph. We consider a one-parameter family of such processes and compute the parameter value in such a way that the centrality condition is satisfied with the greatest possible accuracy. We defined a normalized dimension of paths in the 3D Young graph. We study the growth and oscillations of these normalized dimensions along greedy and random trajectories of the processes using large computer experiments involving 3D Young diagrams with millions of boxes.     

Limiting shapes of birth-and-death processes on Young diagrams

We consider a family of birth processes and birth-and-death processes on Young diagrams of integer partitions of n. This family incorporates three famous models from very different fields: Rost?s totally asymmetric particle model (in discrete time), Simon?s urban growth model, and Moran?s infinite alleles model. We study stationary distributions and limit shapes as n tends to infinity, and present a number of results and conjectures.     

Correlation function of Schur process with application to local geometry of a random 3-dimensional Young diagram

The Schur process is a time-dependent analog of the Schur measure on partitions studied by A. Okounkov in Infinite wedge and random partitions, Selecta Math., New Ser. 7 (2001), 57-81. Our first result is that the correlation functions of the Schur process are determinants with a kernel that has a nice contour integral representation in terms of the parameters of the process. This general result is then applied to a particular specialization of the Schur process, namely to random 3-dimensional Young diagrams. The local geometry of a large random 3-dimensional diagram is described in terms of a determinantal point process on a 2-dimensional lattice with the incomplete beta function kernel (which generalizes the discrete sine kernel). A brief discussion of the universality of this answer concludes the paper.

     

A central limit theorem for extremal characters of the infinite symmetric group

The asymptotic behavior of the lengths of the first rows and columns in the random Young diagrams corresponding to extremal characters of the infinite symmetric group is studied. We consider rows and columns with linear growth in n and prove a central limit theorem for their lengths in the case of distinct Thoma parameters. We also prove a more precise statement relating the growth of rows and columns of Young diagrams to a simple independent random sampling model.     

Enumeration of plane partitions and the algebraic Bethe anzatz

We establish a relation between an exactly solvable boson model and plane partitions, i.e., three-dimensional Young diagrams enclosed in a box of finite size, which allows representing the partition generating functions as correlation functions of an integrable model and deriving the MacMahon formulas for enumerating partitions using the quantum inverse scattering method. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 150, No. 2, pp. 193–203, February, 2007.     

Transition distributions of young diagrams under periodically weighted plancherel measures

Kerov[16,17] proved that Wigner＇s semi-circular law in Gauss[an unitary ensembles is the transition distribution of the omega curve discovered by Vershik and Kerov[34] for the limit shape of random partitions under the Plancherel measure. This establishes a close link between random Plancherel partitions and Gauss[an unitary ensembles, In this paper we aim to consider a general problem, namely, to characterize the transition distribution of the limit shape of random Young diagrams under Poissonized Plancherel measures in a periodic potential, which naturally arises in Nekrasov＇s partition functions and is further studied by Nekrasov and Okounkov[25] and Okounkov[28,29]. We also find an associated matrix mode[ for this transition distribution. Our argument is based on a purely geometric analysis on the relation between matrix models and SeibergWitten differentials.     

Symmetric multiplicative statistics

A family of multiplicative statistics on integer partitions that are symmetric under the conjunction of Young diagrams is constructed. It is shown that all symmetric multiplicative statistics lie in this family. A limit shape of Young diagrams under these statistics is found.Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 240, 1997, pp. 280–289.     

On the combinatorics of plethysm

We construct three (large, reduced) incidence algebras whose semigroups of multiplicative functions, under convolution, are anti-isomorphic, respectively, to the semigroups of what we call partitional, permutational and exponential formal power series without constant term, in infinitely many variables x = (x₁, x₂,…), under plethysm. We compute the Möbius function in each case. These three incidence algebras are the linear duals of incidence bialgebras arising, respectively, from the classes of transversals of partitions (with an order that we define), partitions compatible with permutations (with the usual refinement order), and linear transversals of linear partitions (with the order induced by that on transversals). We define notions of morphisms between partitions, permutations and linear partitions, respectively, whose kernels are defined to be, in each case, transversals, compatible partitions and linear transversals. We introduce, in each case, a pair of sequences of polynomials in x of binomial type, counting morphisms and monomorphisms, and obtain expressions for their connection constants, by summation and Möbius inversion over the corresponding posets of kernels.     

Shuffling algorithm for boxed plane partitions

We introduce discrete time Markov chains that preserve uniform measures on boxed plane partitions. Elementary Markov steps change the size of the box from a×b×c to (a−1)×(b+1)×c or (a+1)×(b−1)×c. Algorithmic realization of each step involves O((a+b)c) operations. One application is an efficient perfect random sampling algorithm for uniformly distributed boxed plane partitions.Trajectories of our Markov chains can be viewed as random point configurations in the three-dimensional lattice. We compute the bulk limits of the correlation functions of the resulting random point process on suitable two-dimensional sections. The limiting correlation functions define a two-dimensional determinantal point processes with certain Gibbs properties.     

Tableaux and plane partitions of truncated shapes

We consider a new kind of straight and shifted plane partitions/Young tableaux – ones whose diagrams are no longer of partition shape, but rather Young diagrams with boxes erased from their upper right ends. We find formulas for the number of standard tableaux in certain cases, namely a shifted staircase without the box in its upper right corner, i.e. truncated by a box, a rectangle truncated by a staircase and a rectangle truncated by a square minus a box. The proofs involve finding the generating function of the corresponding plane partitions using interpretations and formulas for sums of restricted Schur functions and their specializations. The number of standard tableaux is then found as a certain limit of this function.     

Higher‐order analogues of the Tracy‐Widom distribution and the Painlevé II hierarchy

We study Fredholm determinants related to a family of kernels that describe the edge eigenvalue behavior in unitary random matrix models with critical edge points. The kernels are natural higher‐order analogues of the Airy kernel and are built out of functions associated with the Painlevé I hierarchy. The Fredholm determinants related to those kernels are higher‐order generalizations of the Tracy‐Widom distribution. We give an explicit expression for the determinants in terms of a distinguished smooth solution to the Painlevé II hierarchy. In addition, we compute large gap asymptotics for the Fredholm determinants. © 2009 Wiley Periodicals, Inc.     

A Generating Tree Approach to <Emphasis Type="Italic">k</Emphasis>-Nonnesting Partitions and Permutations

We describe a generating tree approach to the enumeration and exhaustive generation of k-nonnesting set partitions and permutations. Unlike previous work in the literature which uses the connections of these objects to Young tableaux and restricted lattice walks, our approach deals directly with partition and permutation diagrams. We provide explicit functional equations for the generating functions, with k as a parameter. Key to the solution is a superset of diagrams that permit semi-arcs. Many of the resulting counting sequences also count other well-known objects, such as Baxter permutations, and Young tableaux of bounded height.     

q-holonomic formulas for colored HOMFLY polynomials of 2-bridge links

We compute q-holonomic formulas for the HOMFLY polynomials of 2-bridge links colored with one-column (or one-row) Young diagrams.     

On Möbius Duality and Coarse-Graining

We study duality relations for zeta and Möbius matrices and monotone conditions on the kernels. We focus on the cases of families of sets and partitions. The conditions for positivity of the dual kernels are stated in terms of the positive Möbius cone of functions, which is described in terms of Sylvester formulae. We study duality under coarse-graining and show that an \(h\)-transform is needed to preserve stochasticity. We give conditions in order that zeta and Möbius matrices admit coarse-graining, and we prove they are satisfied for sets and partitions. This is a source of relevant examples in genetics on the haploid and multi-allelic Cannings models.     

On the Coincidence of Limit Shapes for Integer Partitions and Compositions,and a Slicing of Young Diagrams

We consider the slicing of Young diagrams into slices associated with summands that have equal multiplicities. It is shown that for the uniform measure on all partitions of an integer n, as well as for the uniform measure on partitions of an integer n into m summands with m ∼ An^α, α ≤ 1/2, all slices after rescaling concentrate around their limit shapes. The similar problem is solved for compositions of an integer n into m summands. These results explain why the limit shapes of partitions and compositions coincide in the case α < 1/2. Bibliography: 10 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 307, 2004, pp. 266–280.     

Asymptotics of q-plancherel measures

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 Biane (Int Math Res Notices 4:179–192, 2001) and ?niady (Probab. Theory Relat Fields 136:263–297, 2006). Using the theory of polynomial functions on Young diagrams of Kerov and Olshanski, we are able to compute explicitly the first- and second-order asymptotics of the length of the first rows. Our method also works for other measures, for example those coming from Schur–Weyl representations.     

Analytic combinatorics of chord and hyperchord diagrams with k crossings

Using methods from Analytic Combinatorics, we study the families of perfect matchings, partitions, chord diagrams, and hyperchord diagrams on a disk with a prescribed number of crossings. For each family, we express the generating function of the configurations with exactly k crossings as a rational function of the generating function of crossing-free configurations. Using these expressions, we study the singular behavior of these generating functions and derive asymptotic results on the counting sequences of the configurations with precisely k crossings. Limiting distributions and random generators are also studied.     

Random partitions and the gamma kernel

We study the asymptotics of certain measures on partitions (the so-called z-measures and their relatives) in two different regimes: near the diagonal of the corresponding Young diagram and in the intermediate zone between the diagonal and the edge of the Young diagram. We prove that in both cases the limit correlation functions have determinantal form with a correlation kernel which depends on two real parameters. In the first case the correlation kernel is discrete, and it has a simple expression in terms of the gamma functions. In the second case the correlation kernel is continuous and translationally invariant, and it can be written as a ratio of two suitably scaled hyperbolic sines.