正则序列的分析:求和函数与分治递推
Analysis of Regular Sequences: Summatory Functions and Divide-and-Conquer Recurrences
AI总结:
本文研究了正则序列的渐近分析,证明有限次求和可得到含周期波动的渐近展开,并将该结果应用于分治递推这一2-正则序列,深入分析了多项式代价函数的情形。
摘要:
在 Allouche 和 Shallit 所定义的正则序列的渐近分析中,通常建议研究其求和函数,因为原始序列的行为波动太大。如果序列波动过于剧烈,可能需要重复进行求和的过程。在本文中,我们证明了对于除某些退化情况外的所有正则序列,重复此过程有限次会得到一个包含周期波动的“良好”渐近展开,其傅里叶系数可利用本文前两位作者关于正则序列求和函数渐近性的结果来计算。在最近的一篇论文中,Hwang、Janson 和 Tsai 对分治递推进行了深入研究。这些递推可被视为 $2$-正则序列。通过将它们视为其前向差分的求和函数,关于正则序列求和函数渐近性的结果便得以适用。我们深入研究了多项式代价函数的情形。
英文摘要:
In the asymptotic analysis of regular sequences as defined by Allouche and Shallit, it is usually advisable to study their summatory function because the original sequence has a too fluctuating behaviour. It might be that the process of taking the summatory function has to be repeated if the sequence is fluctuating too much. In this paper we show that for all regular sequences except for some degenerate cases, repeating this process finitely many times leads to a ``nice'' asymptotic expansion containing periodic fluctuations whose Fourier coefficients can be computed using the results on the asymptotics of the summatory function of regular sequences by the first two authors of this paper. In a recent paper, Hwang, Janson, and Tsai perform a thorough investigation of divide-and-conquer recurrences. These can be seen as $2$-regular sequences. By considering them as the summatory function of their forward difference, the results on the asymptotics of the summatory function of regular sequences become applicable. We thoroughly investigate the case of a polynomial toll function.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。