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

关于标号重复递增树的个数

On the Number of Increasing Trees with Label Repetitions

Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger, Stephan Wagner

摘要:

研究了一类由广义演化过程生成的单调标号增树的渐近数。该模型与经典的二叉增树模型的主要区别在于同一个标号可以出现在不同的分支上。在分析的过程中,我们开发了一种方法来提取渐近信息的纯形式的幂级数的系数。该方法是基于一个近似的Borel变换(或,更一般地说,Mittag-Leffler变换),使我们能够快速猜测的指数增长性率。有了这个猜测的序列,然后重新缩放和奇异性分析的生成函数的缩放计数序列产生准确的渐近。实际的分析是基于微分方程和陶伯论证。大小为n的树的计数问题表现出有趣的渐近性,涉及n的幂与无理指数。

英文摘要:

We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and the classical model of binary increasing trees is that the same label can appear in distinct branches of the tree. In the course of the analysis we develop a method to extract asymptotic information on the coefficients of purely formal power series. The method is based on an approximate Borel transform (or, more generally, Mittag-Leffler transform) which enables us to quickly guess the exponential growth rate. With this guess the sequence is then rescaled and a singularity analysis of the generating function of the scaled counting sequence yields accurate asymptotics. The actual analysis is based on differential equations and a Tauberian argument. The counting problem for trees of size n exhibits interesting asymptotics involving powers of n with irrational exponents.

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

↑