91 citations · 520 across the 230 of their papers we have counts for
8 papers · 1 filter
The computational challenge of enumerating high-dimensional rook walks
Manuel Kauers, Doron Zeilberger
We provide guessed recurrence equations for the counting sequences of rook paths on d-dimensional chess boards starting at (0..0) and ending at (n..n), where d=2,3,...,12. Our recu…
HISTABRUT: A Maple Package for Symbol-Crunching in Probability theory
Doron Zeilberger
One of the main uses of computers is to do statistical analysis of data. But, so far, the theory of statistics, and its noble mother, Probability theory, were all discovered and de…
Toward a language theoretic proof of the four color theorem
Bobbe Cooper, Eric Rowland, Doron Zeilberger
This paper considers the problem of showing that every pair of binary trees with the same number of leaves parses a common word under a certain simple grammar. We enumerate the com…
The 1958 Pekeris-Accad-WEIZAC Ground-Breaking Collaboration that Computed Ground States of Two-Electron Atoms (and its 2010 Redux)
Christoph Koutschan, Doron Zeilberger
In order to appreciate how well off we mathematicians and scientists are today, with extremely fast hardware and lots and lots of memory, as well as with powerful software, both fo…
The Number of Inversions and the Major Index of Permutations are Asymptotically Joint-Independently Normal
Andrew Baxter, Doron Zeilberger
We use recurrences (alias difference equations) to prove the longstanding conjecture that the two most important permutation statistics, namely the number of inversions and the maj…
Proofs that if
Doron Zeilberger
There is no trivial mathematics, there are only trivial mathematicians! A mathematician is trivial if he or she believes that there exists trivial mathematics. Being a non-trivial…