Integer Partitions and Exclusion Statistics

نویسندگان

  • Satya N. Majumdar
  • Stéphane Ouvry
چکیده

We provide a combinatorial description of exclusion statistics in terms of minimal difference p partitions. We compute the probability distribution of the number of parts in a random minimal p partition. It is shown that the bosonic point p = 0 is a repulsive fixed point for which the limiting distribution has a Gumbel form. For all positive p the distribution is shown to be Gaussian. PACS numbers: 05.30.Jp, 05.30.Pr, 02.10.Ox

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

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...

متن کامل

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 ...

متن کامل

Partition asymptotics from 1D quantum entropy and energy currents

We give an alternative method to that of Hardy-Ramanujan-Rademacher to derive the leading exponential term in the asymptotic approximation to the partition function p(N, d), defined as the number of decompositions of N into integer summands, with each summand appearing at most d times in a given decomposition. The derivation involves mapping to an equivalent physical problem concerning the aver...

متن کامل

Stirling number of the fourth kind and lucky partitions of a finite set

The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.

متن کامل

Polynomials associated with Partitions: Their Asymptotics and Zeros

Let pn be the number of partitions of an integer n. For each of the partition statistics of counting their parts, ranks, or cranks, there is a natural family of integer polynomials. We investigate their asymptotics and the limiting behavior of their zeros as sets and densities.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007