arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1111.3311math.PRmath.CO
收藏

具有等权部分的随机整数分划乘法系综极限形状的统一推导

Unified derivation of the limit shape for multiplicative ensembles of random integer partitions with equiweighted parts

Leonid V. Bogachev

摘要:

我们得出的极限形状的杨图,与不断增长的整数分区,相对于由生成函数的形式$\mathcal{F}(z)=\prod_{\ell=1}^\infty \mathcal{F}_0(z^\ell)$(这需要相等的权重之间可能的部分$\ell\in\mathbb{N}$)支持的乘法概率测度。在对函数$H_0(u)=\ln(\mathcal{F}_0(u))$的温和技术假设下,我们证明了极限形状$ω^*(x)$的存在,并由方程$y=γ^{-1}H_0(\mathrm{e}^{-γx})$给出,其中$γ^2=\int_0^1 u^{-1}H_0(u)\,\mathrm{d}u$。这一结果所涵盖的划分措施的广泛的类包括(但不限于)代表的三个元类型的可分解组合结构-组装,多集和选择。我们的方法是基于通常的随机化和条件,为此,证明了一个合适的局部极限定理。证明是非常方便的工作与累积量的总和的部分计数,而不是与他们的时刻。

英文摘要:

We derive the limit shape of Young diagrams, associated with growing integer partitions, with respect to multiplicative probability measures underpinned by the generating functions of the form $\mathcal{F}(z)=\prod_{\ell=1}^\infty \mathcal{F}_0(z^\ell)$ (which entails equal weighting among possible parts $\ell\in\mathbb{N}$). Under mild technical assumptions on the function $H_0(u)=\ln(\mathcal{F}_0(u))$, we show that the limit shape $ω^*(x)$ exists and is given by the equation $y=γ^{-1}H_0(\mathrm{e}^{-γx})$, where $γ^2=\int_0^1 u^{-1}H_0(u)\,\mathrm{d}u$. The wide class of partition measures covered by this result includes (but is not limited to) representatives of the three meta-types of decomposable combinatorial structures --- assemblies, multisets and selections. Our method is based on the usual randomization and conditioning; to this end, a suitable local limit theorem is proved. The proofs are greatly facilitated by working with the cumulants of sums of the part counts rather than with their moments.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑