A note on limit shapes of minimal difference partitions
نویسندگان
چکیده
We provide a variational derivation of the limit shape of minimal difference partitions and discuss the link with exclusion statistics. This paper is dedicated to Professor Leonid Pastur for his 70th anniversary. A partition of a natural integer E [1] is a decomposition of E as a sum of a nonincreasing sequence of positive integers {hj}, i.e., E = ∑ j hj such that hj ≥ hj+1, for j = 1, 2 . . .. For example, 4 can be partitioned in 5 ways: 4, 3 + 1, 2 + 2, 2 + 1 + 1, and 1 + 1 + 1 + 1. Partitions can be graphically represented by Young diagrams (also called Ferrers diagrams) where hj corresponds to the height of the j-th column. The {hj}’s are called the parts or the summands of the partition. One can put several constraints on such partitions. For example, one can take the number of columns N to be fixed or put restrictions on the heights. In this paper we focus on a particular constrained partition problem called the minimal difference p partitions (MDP–p). The MDP–p problem is defined by restricting the height difference between two neighboring columns, hj−hj+1 ≥ p. For instance the only allowed partitions of 4 with p = 1 are 4 and 3+1. A typical Young diagram for MDP–p problem is shown in figure 1. Consider now the set of all possible partitions of E satisfying E = ∑ j hj and hj − hj+1 ≥ p. Since this is a finite set, one can put a uniform probability measure on it, which means that all partitions are equiprobable. Then, a natural question is: what is the typical shape of a Young diagram when E → ∞? In the physics literature this problem was first raised by Temperley, who was interested in determining the equilibrium profile of a simple cubic crystal grown from the corner of three walls at right angles. The two dimensional version of the problem —where walls (two) are along the horizontal and the vertical axes and E “bricks” (molecules) are packed into the first quadrant one by one such that each brick, when it is added, makes two contact along faces— corresponds
منابع مشابه
Integer partitions and exclusion statistics: Limit shapes and the largest part of Young diagrams
We compute the limit shapes of the Young diagrams of the minimal difference p partitions and provide a simple physical interpretation for the limit shapes. We also calculate the asymptotic distribution of the largest part of the Young diagram and show that the scaled distribution has a Gumbel form for all p. This Gumbel statistics for the largest part remains unchanged even for general partitio...
متن کاملLimit shapes for Gibbs ensembles of partitions
We explicitly compute limit shapes for several grand canonical Gibbs ensembles of partitions of integers. These ensembles appear in models of aggregation and are also related to invariant measures of zero range and coagulation-fragmentation processes. We show, that all possible limit shapes for these ensembles fall into several distinct classes determined by the asymptotics of the internal ener...
متن کاملNormal Convergence for Random Partitions with Multiplicative Measures
Let Pn be the space of partitions of integer n ≥ 0, P the space of all partitions, and define a class of multiplicative measures induced by Fβ(z) = ∏ k(1 − zk)k β with β > −1. Based on limit shapes and other asymptotic properties studied by Vershik, we establish normal convergence for the size and parts of random partitions.
متن کاملEffect of nanoparticle shape on natural convection heat transfer in a square cavity with partitions using water-SiO2 nanofluid
In this paper a numerical investigation is performed to study the effects of different nanofluids on convective heat transfer enhancement in a partitioned square cavity subject to different shapes of nanoparticle using water-SiO2 nanofluid. This study has been carried out to analyze the effects of SiO2 nanoparticle, its volumetric fraction between 2 and 4%, and nanoparticle shape (i.e. blades, ...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کامل