6 citations · 25 across the 23 of their papers we have counts for
5 papers · 1 filter
The Discrete Analog of the Malgrange-Ehrenpreis Theorem
Doron Zeilberger
One of the landmarks of the modern theory of partial differential equations is the Malgrange- Ehrenpreis theorem that states that every non-zero linear partial differential operato…
The C-finite Ansatz
Doron Zeilberger
While it is trivial to multiply two C-finite sequences (just like integers), it is not quite so trivial to "factorize" them, or to decide whether they are "prime". The former is pl…
Balls in Boxes: Variations on a Theme of Warren Ewens and Herbert Wilf
Shalosh B. Ekhad, Doron Zeilberger
We comment on, elaborate, and extend the work of Warren Ewens and Herbert Wilf, described in their http://www.pnas.org/content/104/27/11189.full.pdf about the maximum in balls-and-…
Automatic Generation of Generating Functions for Chromatic Polynomials for Grid Graphs (and more general creatures) of Fixed (but arbitrary!) Width
Shalosh B. Ekhad, Jocelyn Quaintance, Doron Zeilberger
This short article, dedicated to our beloved guru Philippe FLAJOLET (1948-2011), is a case-study in computer-generated combinatorial research, where the computer, all by itself, is…
Automatic Generation of Theorems and Proofs on Enumerating Consecutive-Wilf classes
Andrew Baxter, Brian Nakamura, Doron Zeilberger
This article, dedicated to Herbert Saul Wilf on the occaison of his forthcoming 80-th birthday, describes two complementary approaches to enumeration, the "positive" and the "negat…