当前位置:
X-MOL 学术
›
arXiv.cs.SC
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
There are EXACTLY 1493804444499093354916284290188948031229880469556 Ways to Derange a Standard Deck of Cards (ignoring suits) [and many other such useful facts]
arXiv - CS - Symbolic Computation Pub Date : 2021-01-25 , DOI: arxiv-2101.10147 Shalosh B. Ekhad, Christoph Koutschan, Doron Zeilberger
arXiv - CS - Symbolic Computation Pub Date : 2021-01-25 , DOI: arxiv-2101.10147 Shalosh B. Ekhad, Christoph Koutschan, Doron Zeilberger
In this memorial tribute to Joe Gillis, who taught us that Special Functions
count, we show how the seminal Even-Gillis integral formula for the number of
derangements of a multiset, in terms of Laguerre polynomials, can be used to
efficiently compute not only the number of the title, but much harder ones,
when it is interfaced with Wilf-Zeilberger algorithmic proof theory.
中文翻译:
确实有1493804444499093354916284290188948031229880469556排列标准纸牌的方法(忽略西服)[以及许多其他有用的事实]
在向乔·吉利斯(Joe Gillis)的致敬致敬中,他教导我们特殊函数很重要,我们展示了如何用Laguerre多项式来描述多集的重排次数的开创性的偶数吉利积分公式,不仅可以有效地计算出当与Wilf-Zeilberger算法证明理论对接时,标题的数量会增加,但难度要大得多。
更新日期:2021-01-26
中文翻译:
确实有1493804444499093354916284290188948031229880469556排列标准纸牌的方法(忽略西服)[以及许多其他有用的事实]
在向乔·吉利斯(Joe Gillis)的致敬致敬中,他教导我们特殊函数很重要,我们展示了如何用Laguerre多项式来描述多集的重排次数的开创性的偶数吉利积分公式,不仅可以有效地计算出当与Wilf-Zeilberger算法证明理论对接时,标题的数量会增加,但难度要大得多。