arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.01441math.COmath.NTmath.PR
收藏

锦标赛得分序列、Erdős-Ginzburg-Ziv数与Lévy-Khintchine方法

Tournament score sequences, Erdős-Ginzburg-Ziv numbers, and the Lévy-Khintchine method

Michal Bassan, Serte Donderwinkel, Brett Kolesnik

AI总结:

该研究利用格路表示与Lévy-Khintchine公式,简短证明了锦标赛得分序列数与Erdős-Ginzburg-Ziv数的关联,并用该方法证明了Moser关于得分序列数渐近行为的猜想。

摘要:

我们给出了Claesson、Dukes、Franklín和Stefánsson近期一项结果的简短证明,该结果将得分序列的数量$S_n$与加性数论中的Erdős-Ginzburg-Ziv数$N_n$联系起来。我们的证明运用了Erdős和Moser提出的得分序列格路表示,以及Kleitman在Moser一篇关于此类格路循环移位的论文中补充的注记。$S_n$与$N_n$之间的联系是概率论中Lévy-Khintchine公式的一个实例。我们通过给出Moser猜想(即$S_n\thicksim C4^n/n^{5/2}$,其中$C$由$N_n$表示)的简短证明,凸显了这类公式的实用性。

英文摘要:

We give a short proof of a recent result of Claesson, Dukes, Franklín and Stefánsson, connecting the number $S_n$ of score sequences and the Erdős-Ginzburg-Ziv numbers $N_n$ from additive number theory. Our proof utilizes the lattice path representation of score sequences by Erdős and Moser, and remarks by Kleitman added to an article of Moser regarding cyclic shifts of such paths. The connection between $S_n$ and $N_n$ is an instance of the Lévy-Khintchine formula from probability theory. We highlight the utility of such formulas, by giving a short proof of Moser's conjecture that $S_n\sim C4^n/n^{5/2}$, where $C$ is described in terms of $N_n$.

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

↑