91 citations · 520 across the 230 of their papers we have counts for
8 papers · 1 filter
Automated Counting of Towers (À La Bordelaise) [Or: Footnote to p. 81 of the Flajolet-Sedgewick Chef-d'œvre]
Shalosh B. Ekhad, Doron Zeilberger
The brilliant idea of Jean Betrema and Jean-Guy Penaud that proved the celebrated "three to the power n" theorem of Dominique Gouyou-Beauchamps and Xavier Viennot, counting towers…
Pick Up Sticks
Larry Shepp, Doron Zeilberger, Cun-Hui Zhang
We apply a classic result in Theoretical Computer Science to solve a sticky problem, and give a neat and slick quick proof of half of it
Using Noonan-Zeilberger Functional Equations to enumerate (in Polynomial Time!) Generalized Wilf classes
Brian Nakamura, Doron Zeilberger
One of the most challenging problems in enumerative combinatorics is to count Wilf classes, where you are given a pattern, or set of patterns, and you are asked to find a "formula"…
The Amazing Theorem and its even more Amazing Proof [Discovered by Xavier G. Viennot and his École Bordelaise gang]
Doron Zeilberger
The most amazing (at least to me) result in Enumerative Combinatorics is Dominique Gouyou-Beauchamps and Xavier Viennot's theorem that states that the number of so-called directed…
Automatic Counting of Tilings of Skinny Plane Regions
Shalosh B. Ekhad, Doron Zeilberger
The deductive method ruled mathematics for the last 2500 years, now it is the turn of the inductive method. Here we make a modest start by using the inductive method to discover an…
The Reciprocal of for non-commuting and , Catalan numbers and non-commutative quadratic equations
Arkady Berenstein, Vladimir Retakh, Christophe Reutenauer +1
The aim of this paper is to describe the inversion of the sum where and are non-commuting variables as a formal series in and . We show that t…