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

平面分拆统计量期望的渐近分析

Asymptotic Analysis of Expectations of Plane Partition Statistics

Ljuben Mutafchiev

摘要:

假设一个平面分区的正整数$n$均匀随机选择从所有这样的分区的集合,我们提出了一个一般的渐近计划的期望计算的各种平面分区统计$n$变大。在这项研究中出现的生成函数的形式$Q(x)F(x)$,其中$Q(x)=\prod_{j=1}^\infty (1-x^j)^{-j}$是平面分区的数量的生成函数。我们展示了如何可以直接从$x=1$周围的函数$F(x)$的渐近展开的渐近期望。将平面分区表示为体积$n$的实体图,可以根据其尺寸和形状来解释这些统计数据。作为我们主要结果的应用,我们得到了最大部分(立体图的高度)和迹(立体图的主对角线上的壁中立方体的数目)的期望值的渐近性质。我们的结果类似于Grabner等人(2014)关于线性整数划分统计的结果。我们的研究是基于Hayman的容许幂级数方法。

英文摘要:

Assuming that a plane partition of the positive integer $n$ is chosen uniformly at random from the set of all such partitions, we propose a general asymptotic scheme for the computation of expectations of various plane partition statistics as $n$ becomes large. The generating functions that arise in this study are of the form $Q(x)F(x)$, where $Q(x)=\prod_{j=1}^\infty (1-x^j)^{-j}$ is the generating function for the number of plane partitions. We show how asymptotics of such expectations can be obtained directly from the asymptotic expansion of the function $F(x)$ around $x=1$. The representation of a plane partition as a solid diagram of volume $n$ allows interpretations of these statistics in terms of its dimensions and shape. As an application of our main result, we obtain the asymptotic behavior of the expected values of the largest part (the height of the solid diagram) and the trace (the number of cubes in the wall on the main diagonal of the solid diagram). Our results are similar to those of Grabner et al. (2014) related to linear integer partition statistics. We base our study on Hayman's method for admissible power series.

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

↑