91 citations · 520 across the 230 of their papers we have counts for
5 papers · 2 filters
On the Intriguing Problem of Counting (n+1,n+2)-Core Partitions into Odd Parts
Anthony Zaleski, Doron Zeilberger
Tewodros Amdeberhan and Armin Straub initiated the study of enumerating subfamilies of the set of (s,t)-core partitions. While the enumeration of (n+1,n+2)-core partitions into dis…
A Treatise on Sucker's Bets
Shalosh B. Ekhad, Doron Zeilberger
In 1970, Statistics giant, Bradley Efron, amazed the world by coming up with a set of four dice, let's call them A,B,C,D, whose faces are marked with [0,0,4,4,4,4], [3,3,3,3,3,3],[…
On The Limiting Distributions of the Total Height On Families of Trees
Andrew Lohr, Doron Zeilberger
A symbolic-computational algorithm, fully implemented in Maple, is described, that computes explicit expressions for generating functions that enable the efficient computations of…
Counting Permutations that Avoid Many Patterns
Yonah Biers-Ariel, Haripriya Chakraborty, John Chiarelli +8
This paper presents a collection of experimental results regarding permutation pattern avoidance, focusing on cases where there are "many" patterns to be avoided.
Analysis of the gift exchange problem
Moa Apagodu, David Applegate, N. J. A. Sloane +1
In the gift exchange game there are n players and n wrapped gifts. When a player's number is called, that person can either choose one of the remaining wrapped gifts, or can "steal…