28 citations · 109 across the 91 of their papers we have counts for
93 papers
Estimating Many Constants With a Coin
Shalosh B. Ekhad, Doron Zeilberger
We extend, and fully implement, in Maple, Jim Propp's charming way of estimating Pi via tossing a fair coin, and compute many other constants, even going beyond the far more genera…
Experimenting with the Garsia-Milne Involution Principle
Shalosh B. Ekhad, Doron Zeilberger
In 1981, Adriano Garsia and Steve Milne found the first bijective proof of the celebrated Rogers-Ramanujan identities. To achieve this feat, they invented a versatile tool that the…
Efficient Weighted Counting of Multiset Derangements
Shalosh B. Ekhad, Doron Zeilberger
We use the Almkvist-Zeilberger algorithm, combined with a weighted version of the Even-Gillis Laguerre integral due to Foata and Zeilberger, in order to efficiently compute weight…
The Asymptotic expansion of OEIS sequence A85
Shalosh B. Ekhad, Manuel Kauers, Doron Zeilberger
One of the most important sequences in enumerative combinatorics is OEIS sequence A85, the number of involutions of length n. In the Art of Computer Programming, vol. 3, Don Knuth…
Exploring Werner Krandick's Binary Tree Jump Statistics
Shalosh B. Ekhad, Doron Zeilberger
Twenty years ago, Werner Krandick defined two statistics on binary trees. The first one determines the number of jumps, when traversing the tree in depth-first-search, from a verte…
In How Ways Can You Play Stanley Solitaire?
Shalosh B. Ekhad, Doron Zeilberger
We introduce a very simple solitaire game, named Stanley Solitaire, in honor of Richard Stanley, and prove an explicit closed-form formula for the number of ways of playing it. Ala…