I ask only once a year: please help the Internet Archive today. Most can’t afford to give, but we hope you can. The average donation is $45. If everyone chips in $5, we can end this fundraiser today. Right now, a generous supporter will match your donation 2-to-1, so you can triple your impact. All we need is the price of a paperback book to sustain a library you can trust. We have only 150 staff but run one of the world’s top websites. We’re dedicated to reader privacy so we never track you. We never accept ads. But we still need to pay for servers and staff. For 22 years, my dream has been to build the library of everything and make it available to everyone. To make information more reliable and permanent. I know we could charge money, but then we couldn’t achieve our mission: a free library for the whole internet. The Internet Archive is a bargain, but we need your help. If you find our site useful, please chip in. Thank you.
—Brewster Kahle, Founder, Internet Archive

I ask only once a year: please help the Internet Archive today. The average donation is $45. If everyone chips in $5, we can end this fundraiser today. Right now, your donation will be matched, doubling your impact! All we need is the price of a paperback book to sustain a library the whole world trusts. We’re dedicated to reader privacy so we never track you. We never accept ads. But we still need to pay for servers and staff. For 22 years, my dream has been to build the library of everything and make it available to everyone. I know we could charge money, but then we couldn’t achieve our mission. The Internet Archive is a bargain, but we need your help. If you find our site useful, please chip in. Thank you.
—Brewster Kahle, Founder, Internet Archive

I ask only once a year: please help the Internet Archive today. The average donation is $45. If everyone chips in $5, we can end this fundraiser today. Right now, your donation will be matched, doubling your impact! All we need is the price of a paperback book to sustain a library the whole world trusts. We’re dedicated to reader privacy so we never track you. We never accept ads. But we still need to pay for servers and staff. For 22 years, my dream has been to build the library of everything and make it available to everyone. I know we could charge money, but then we couldn’t achieve our mission. The Internet Archive is a bargain, but we need your help. If you find our site useful, please chip in. Thank you.
—Brewster Kahle, Founder, Internet Archive

I ask only once a year: please help the Internet Archive today. The average donation is $45. If everyone chips in $5, we can end this fundraiser today. Right now, your donation will be matched 2-to-1, tripling your impact! All we need is the price of a paperback book to sustain a library the whole world trusts. We have only 150 staff but run one of the world’s top websites. We’re dedicated to reader privacy. We never accept ads. But we still need to pay for servers and staff. The Internet Archive is a bargain, but we need your help. If you find our site useful, please chip in.
—Brewster Kahle, Founder, Internet Archive

We are interested in the properties of multipartite entanglement of a system composed by $n$ $d$-level parties (qudits). Focussing our attention on pure states we want to tackle the problem of the maximization of the entanglement for such systems. In particular we effort the problem trying to minimize the purity of the system. It has been shown that not for all systems this function can reach its lower bound, however it can be proved that for all values of $n$ a $d$ can always be found such that the lower bound can be reached. In this paper we examine the high-temperature expansion of the distribution function of the bipartite purity over all balanced bipartition considering its optimization problem as a problem of statistical mechanics. In particular we prove that the series characterizing the expansion converges and we analyze the behavior of each term of the series as $d\to \infty$.