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

多项式的根与排列问题

Roots of Polynomials and The Derangement Problem

Lior Bary-Soroker, Ofir Gorodetsky

摘要:

我们提出了一个新的证明,其中一个最古老的结果,在概率说,概率随机排列$n$元素没有不动点趋于$e^{-1}$作为$n$趋于无穷大。我们的证明源于有限域上的置换和多项式之间的联系,并基于一个独立的参数,这是平凡的多项式世界。

英文摘要:

We present a new killing-a-fly-with-a-sledgehammer proof of one of the oldest results in probability which says that the probability that a random permutation on $n$ elements has no fixed points tends to $e^{-1}$ as $n$ tends to infinity. Our proof stems from the connection between permutations and polynomials over finite fields and is based on an independence argument, which is trivial in the polynomial world.

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

↑