
%---------plain TeX file of D.Zeilberger's publication-----------
 
 
\magnification=1200
\overfullrule=0in
\parindent=0pt
\def\Tilde{\char126\relax}
\centerline{\bf PUBLICATIONS of Doron ZEILBERGER}
\medskip
{\bf Last Update: March. 13, 2006}
\medskip
 
This list, as well as most of the papers published after 1990, are available 
at

{\tt http://www.math.rutgers.edu/\Tilde zeilberg}.

1. (With D. Nicholson, P. Rabinowitz and N. Richter) {\it On the Error in
the Numerical Integration of Chebyshev Polynomials}, Math.
Computation {\bf 25}, 79-86 (1971).
 
2. {\it Uniqueness Theorems for Harmonic Functions of Exponential
Growth}, Proc. Amer. Math. Soc. {\bf 61},  335-340 (1976).
 
3. {\it Binary Operations in the set of solutions of a Partial
Difference Equation}, Proc. Amer. Math. Soc. {\bf 62}, 242-244
(1977).
 
 
4. {\it A new approach to the theory of Discrete Analytic
Functions}, J. Math. Anal. Appl. {\bf 57}, 350-367 (1977).
 
 
5. (With H.Dym) {\it Further properties of Discrete Analytic
Functions}, J. Math. Anal. Appl. {\bf 58}, 405-418 (1977).
 
 
6. {\it A new basis for Discrete Analytic Functions}, J. Australian
Math. Soc. {\bf 23} (series A), 95-104 (1977).
 
 
7. {\it Discrete Analytic Functions of exponential growth}, Trans.
Amer. Math. Soc. {\bf 226}, 181-189 (1977).
 
 
8. {\it A discrete analog of the Paley-Wiener theorem in a half
plane}, J. Australian Math. Soc. (Series A) {\bf 23},
376-378 (1978).
 
 
9. {\it A new proof of Ehrenpreis's semi-local Quotient Structure
Theorem}, Amer. J. Math. {\bf 100}, 1317-1332 (1978).
 
 
10. {\it The Pompeiu problem for discrete space}, Proc. Natl. Acad.
Sci. {\bf 75}, 3555-3556 (1978).
 
 
11. {\it  Solutions of exponential growth to systems of partial
differential equations}, J. Diff. Eq. {\bf 31}, 287-295 (1979).
 
 
12. {\it  The algebra of linear partial difference operators and its
applications}, SIAM J. Math. Anal. {\bf 11}, 919-934 (1980).
 
 
13. {\it  Some comments on Rota's umbral calculus}, J. Math. Anal.
Appl. {\bf 74}, 456-463 (1980).
 
 
14. {\it  A lattice walk approach to the q-counting of multiset
permutations}, J. Math. Anal. Appl. {\bf 74}, 192-199 (1980).
 
 
15. {\it  Partial difference equations in $ m_1 \geq ... \geq m_n
\geq 0 $ and their applications to combinatorics}, Discrete Math
{\bf 31}, 65-77 (1980).
 
 
16. {\it  Enumerating words by their number of mistakes}, Discrete
Math {\bf 34}, 89-91 (1981).
 
 
17. {\it  All binomial identities are verifiable}, Proc. Natl. Acad.
Sci. {\bf 78}, 4000 (1981).
 
 
18. {\it  Sister Celine's technique and its generalizations}, J. Math.
Anal. Appl. {\bf 85}, 114-145 (1982).
 
 
19. (With D. Franzblau) {\it  A bijection proof of the hook length
formula}, J. Algorithms {\bf 3}, 317-343 (1982).
 
 
20. (With D. Bressoud) {\it A short Rogers-Ramanujan bijection},
Discrete Math. {\bf 38}, 313-315 (1982).
 
 
21. {\it  A combinatorial proof of Dyson's conjecture}, Discrete
Math. {\bf 41}, 317-321 (1982).
 
 
22. (With S. R. Caplan) {\it T. L. Hill's graphical method for solving
linear equations}, Advances in Appl. Math. {\bf 3}, 377-383
(1982).
 
 
23. (With L. Shapiro) {\it A Markov chain occurring in Enzyme
Kinetics}, J. Math. Biology {\bf 15}, 351-357 (1982).
 
 
24. (With J. Gillis) {\it A direct combinatorial proof of a positivity
result}, European J. Comb. {\bf 4}, 221-223 (1983).
 
 
25. {\it  Andre's reflection proof generalized to the many-candidate
ballot problem}, Discrete Math {\bf 44}, 325-326 (1983). 
 
 
26. (With J. Gillis and B. Reznick) {\it  Elementary methods in positivity
theory}, SIAM J. Math. Anal. {\bf 14}, 396-398 (1983).
 
 
27. {\it A combinatorial proof of Newton's identities}, Discrete
Math. {\bf 49}, 319 (1984).
 
 
28. {\it  A short hook-length bijection inspired by the
Greene-Nijenhuis-Wilf proof}, Discrete Math. {\bf 51}, 101-108 
(1984).
 
 
29. {\it  Garsia and Milne's proof of the inclusion-exclusion
principle}, Discrete Math. {\bf 51}, 109-110 (1984).
 
 
30. (With D. Foata) {\it Weighted derangements and Laguerre
polynomials}, Actes S\'emin. Lotharingien 
de combinatoire {\bf 8}, 20-29 (1984).
 
 
31. (With E. A. Bender) {\it Some asymptotic bijections}, J. Comb. Th.
(Ser A) {\bf 38}, 96-98 (1985).
 
 
32. (With D. Bressoud) {\it A proof of Andrews' q-Dyson conjecture},
Discrete Math. {\bf 54}, 201-224 (1985).
 
 
33. (With J. Wimp) {\it Resurrecting the asymptotics of linear
recurrences}, J. Math. Anal. Appl. {\bf 111}, 162-177 (1985).
 
 
34. {\it  A combinatorial approach to matrix algebra}, Discrete
Math. {\bf 56}, 61-72 (1985).
 
 
35. (With D. Bressoud) {\it Bijecting Euler's partitions recurrence},
Amer. Math. Monthly {\bf 92}, 55-56 (1985).
 
 
36. (With M. Werman) {\it Bijecting Cassini's Fibonacci identity},
Discrete Math. {\bf 58}, 109 (1986).
 
 
37. {\it  Toward a combinatorial proof of the Jacobian conjecture?},
Proc. of the "Colloque de combinatoire \'enum\'erative", G.Labelle and
P.Leroux, editors, Lecture Notes in Math. {\bf 1234}, 370-380,
Springer-Verlag, Berlin (1987). 
 
 
38. {\it A proof of the $ G_2 $ case of Macdonald's root
system-Dyson conjecture}, SIAM J. Math.
Anal. {\bf 18}, 880-883 (1987).
 
 
39. (With D. Bressoud) {\it Generalized Rogers-Ramanujan identities}, 
Advances in Math. {\bf78}, 42-75 (1989).
 
 
40. {\it  A q-Foata proof of the q-Saalsch\"utz identity},  European
J. Comb. {\bf 8}, 461-463 (1987).
 
 
41. {\it Enumerating totally clean words}, Discrete
Math. {\bf 64}, 313-315 (1987).
 
 
42. {\it One line proofs of the unimodality of The Gaussian
polynomials $G(n,k)$, for $k=3,4$}, Ars Comb.,  {\bf 24}, 165-166 (1987).
 
 
43. {\it A bijection from ordered trees to binary trees that sends the
pruning order to the Strahler number}, Discrete Math. {\bf 82},
89-92 (1990).
 
 
44. (With J. Gillis and J. Jedwab) {\it  A combinatorial interpretation of
the integral of the products of Legendre polynomials},  SIAM J.
Math. Anal. {\bf 19}, 1455-1461 (1988).
 
 
45. {\it A unified approach to Macdonald's root-system conjectures},
SIAM J. Math. Anal. {\bf 19}, 987-1013 (1988).
 
 
46. {\it A Stembridge-Stanton style proof of the Habsieger-Kadell
q-Morris identity}, Discrete Math. {\bf 79}, 313-322 (1989/90).
 
 
47. (With D. Foata) {\it Laguerre polynomials, weighted derangements,
and positivity}, SIAM J. Discrete Math. {\bf 1}, 425-433 (1988).
 
 
48. (With D. Foata) {\it Linearization coefficients for the Jacobi
polynomials}, Actes S\'eminaire Lotharingien {\bf 16}, 73-86, Publ.
I.R.M.A., Strasburg (1988).
 
 
49. {\it Six Etudes in generating functions}, Intern. J. Computer
Math. {\bf 29}, 201-215 (1989).
 
 
50. {\it  A combinatorial problem that arose in biophysics}, Fibonacci
Quarterly {\bf 27}, 372 (1989).
 
 
51. {\it  On a conjecture of R.J.Simpson about exact covering
sequences}, Amer. Math. Monthly {\bf 96}, 243 (1989).
 
 
52. {\it  Kathy O'hara's constructive proof of the unimodality of the
Gaussian polynomials}, Amer. Math. Monthly {\bf 96},
590-602 (1989).
 
 
53. {\it  One line proofs of the unimodality of the Gaussian polynomials
$G(n,k)$ for $k < 20$}, in: D. Stanton, 
ed., ``q-Series and Partitions", 
(Proc., IMA, March 1988), IMA series {\bf 18}, Springer, 35-44 (1989).
 
 
54. (With D. Stanton) {\it The Odlyzko conjecture and O'Hara's
unimodality proof}, Proc. Amer. Math. Soc. {\bf 107}, 39-42
(1989).
 
 
55. {\it  Identities}, in: D. Stanton, ed., ``q-Series and Partitions",
(Proc., IMA, March 1988), IMA series {\bf 18}, 67-75 (1989).
 
 
56. {\it A Holonomic systems approach to special functions
identities}, J. of Computational and Applied Math. {\bf 32},
321-368 (1990).
 
 
57. (With S. B. Ekhad) {\it A $21^{st}$ century proof of
Dougall's hypergeometric identity}, J. Math. Anal. Appl. {\bf 147},
610-611 (1990).
 
 
58. {\it  A Fast Algorithm for proving terminating hypergeometric
identities}, Discrete Math {\bf 80}, 207-211, (1990).
 
 
59. (With H. S. Wilf) {\it Rational functions certify combinatorial
identities}, J. Amer. Math. Soc. {\bf 3}, 147-158 (1990).
 
 
60. (With J. Wimp) {\it How likely is Polya's drunkard to stay in  $x \geq
y \geq z$ ?}, J. Statistical Physics {\bf 57}, 1129-1135 (1989).
 
 
61. (With G. Almkvist) {\it The method of differentiating under the
integral sign}, J. Symbolic Computation {\bf 10}, 571-591 (1990).
 
 
62. {\it The method of creative telescoping}, J. Symbolic Computation
{\bf 11}, 195-204 (1991).
 
 
63. (With D. Foata) {\it Denert's permutation statistic is indeed
Euler-Mahonian}, Studies in Applied Math {\bf 83}, 31-59 (1990).
 
64. (With D. Foata) {\it Multibasic Eulerian polynomials},
Trans. Amer. Math. Soc. {\bf 328}, 843-862 (1991).
 
65. (With R. J. Simpson) {\it Necessary conditions for distinct
covering systems with square-free moduli}, Acta Arithmetica
{\bf 59}, 59-70 (1991).
 
 
66. (With H. S. Wilf) {\it Towards computerized proofs of identities},
Bulletin of the Amer. Math. Soc. {\bf 23}, 77-83 (1990).
 
 
67. {\it Gauss's ${}_2 F_1 (1)$ cannot be generalized to}
${}_2 F_1 (x)$, J. Comp. Appl. Math. {\bf 39},
379-382 (1992).
 
 
68. (With I. Gessel) {\it Random Walk in a Weyl chamber}, Proc.
Amer. Math. Soc. {\bf 115}, 27-31 (1992).
 
 
69. {\it Closed Form (pun intended!)}, 
 in: ``Special volume in memory of Emil Grosswald", M. Knopp
and M. Sheingorn,
eds., Contemporary Mathematics {\bf 143} 579-607, AMS, Providence (1993).
 
 
70. {\it Gert Almkvist's generalization of a mistake of Bourbaki},
 in: ``Special volume in memory of Emil Grosswald", M. Knopp
and M. Sheingorn,
eds., Contemporary Mathematics {\bf 143} 609-612, AMS, Providence (1993).
 
71. {\it Three recitations on Holonomic Systems and 
Hypergeometric Series}, Proceeding of the S\'eminaire
Lotharingien de combinatoire {\bf 24},5-37, IRMA, Strasbourg. (1993)
(To be reprinted in Journal Symbolic Computation.)
 
72. {\it A constant term identity featuring the ubiquitous (and mysterious)
Andrews-Mills-Robbins-Rumsey numbers $\{1,2,7,42,429, ...\}$}, 
J. Combinatorial Theory (ser. A) {\bf 66}, 17-27 (1994).
 
73. {\it A proof of Julian West's conjecture that the number of
2-stack-sortable permutations of length $n$ is}
$2 (3n)! /((2n+1)! (n+1)!)$, Discrete Math. {\bf 102}, 85-93 (1992).
 
74. {\it Identities in search of identity}, J. Theoretical Computer Science
{\bf 117}, 23-38 (1993).
 
75. (With Jane Friedman) A generalization of Odlyzko's conjecture:
the coefficients of 
$(1-q)^{j} /(( 1- q^{2n} ) ... (1- q^{2n+2j} ))$ alternate in
sign,  Proc. Amer. Math. Soc. {\bf 118}, 1013 (1993).
 
76. (With H.S. Wilf) {\it An algorithmic proof theory for hypergeometric
(ordinary and ``q") multisum/integral identities}, Invent. Math. 
{\bf 108}, 575-633 (1992).
 
77. (With S.B. Ekhad) {\it A one-line WZ proof of a formula of Ramanujan
for $\pi$}, in: ``Geometry, Analysis, and Mechanics''
(Volume to honor Archimedes's 2281st birthday), J. M. Rassias, ed.,
107-108. World Scientific, Singapore (1994).
 
78.(with Jane Friedman and Ira Gessel) 
{\it Talmudic lattice path counting}, 
J. Combin. Theory Ser. A {\bf 68}, 215-217 (1994).
 
79. {\it Proof of q-analog of a constant term identity 
conjectured by Forrester}, J. Combinatorial Theory {\bf 66},
311-312 (1994).
 
80. (With H. S. Wilf) {\it Rational function certification of
hypergeometric multi-integral/sum/``q" identities}, 
Bulletin of the Amer. Math. Soc. {\bf 27}, 148-153 (1992).
 
81. (With G.E. Andrews and S.B. Ekhad), {\it A short proof of
Jacobi's formula for the number of representations of an integer
as a sum of four squares}, Amer. Math. Monthly, {\bf 100}, 274-276 (1993).
 
82. {\it  Towards a WZ proof of Mehta's integral}, SIAM J. Math. Anal.
{\bf 25} , 812-814 (1994).
 
83. (With S. B. Ekhad) {\it A  short and elementary,
``formal calculus" proof of the Bieberbach
conjecture (after L. Weinstein)}, Contemporary Math {\bf 178 } 113-115, 
(1995).
 
 
84. (With D. Foata) {\it Combinatorial Proofs of Cappelli's
and Turnbull's Identities from Classical Invariant Theory}, Electronic
J. of Combinatorics

({\tt http://www.combinatorics.org}), {\bf 1}, R1 ( 7 pages) (1994).
 
85. {\it Proof of the alternating sign matrix conjecture}, Elect. J. 
Combinatorics

({\tt http://www.combinatorics.org}), {\bf 3(2)} 
[Foata Festschrift] R13, (50 pages)(1996).
 
86. {\it Theorems for a price: Tomorrow's semi-rigorous mathematical culture},
Notices of the Amer. Math. Soc. {\bf 40 \# 8}, 978-981 (Oct. 1993).
Reprinted: Math. Intell. {\bf 16}, no. 4, 11-14 (Fall 1994).
 
87. {\it Chu's 1303 identity implies Bombieri's 1990 norm-inequality
[Via an identity of Beauzamy and D\'egot]}, Amer. Math. Monthly {\bf 101},
894-895 (1994).
 
88. {\it How Joe Gillis discovered Combinatorial Special Function Theory},
Math. Intell. {\bf 17}, no. 2, 65-66 (Spring 1995). 
 
89. (With L. Ehrenpreis) {\it Two EZ proofs of $\sin^2 z + \cos^2 z =1$},
Amer Math. Monthly {\bf 101}, 691 (1994).
  
90. (With C. Orr), {\it A computer algebra approach to the discrete
Dirichlet problem}, J. Symbolic Comput. {\bf 18}, 87-90 (1994).
 
91. {\it On an identity of Daubechies},
Amer. Math. Monthly {\bf 100}, 487 (1993).
 
92. {\it The J.C.P. Miller Recurrence for Exponentiating a polynomial
and its q-Analog}, J. Difference Eqs. and Appls. {\bf 1}, 57-60 (1995). 
 
93. {\it Proof of the refined alternating sign matrix conjecture},
New York J. of Math. (elec.), 
({\tt http://nyjm.albany.edu/})
{\bf 2}, 59-68 (1996).
 
94. (With D. Foata), {\it The Graphical Major Index}, J. Comp. Appl. Math.,
[specal issue on q-series], 
J. Comput. Applied Math (special issue on q-series)
{\bf 68} 79-101 (1996).
 
95. (With J. Noonan), {\it Counting Permutations with a prescribed
number of ``forbidden" patterns}, Advances in Applied Math. {\bf 17},
381-407 (1996).
 
96. {\it Reverand Charles to the aid of Major Percy and Fields-Medalist
Enrico}, Amer. Math. Monthly {\bf 103}, 501-502 (1996).
 
97. {\it The method of undetermined generalization and specialization
illustrated with Fred Galvin's amazing proof of the Dinitz conjecture},
Amer. Math. Monthly {\bf 103}, 233-240 (1996).
 
98. {\it An explicit formula for the number of solutions of $X^2=0$
in triangular matrices over GF(q)}, 
Elect. J. Comb({\tt http://www.combinatorics.org}). {\bf 3(1)}, R3 
(3 pages)(1996).
 
99. {\it Self-Avoiding Walks, the language of science, and Fibonacci numbers},
J. Stat. Planning and Inference {\bf 54}, 135-138 (1996).
 
100. {\it If $A_n$ has $6n$ dyes in a box, with which he has to fling at
least $n$ sixes, then $A_n$ has an easier task than $A_{n+1}$,
at Eaven Luck}, Amer. Math. Monthly {\bf 103}, 265 (1996).
 
101. (With S. B. Ekhad){\it Curing the Andrews Syndrome},
J. of Difference Equations and Applications {\bf 4}, 299-310 (1997).
 
102. (With T. Amdeberhan)
{\it Hypergeometric Series Acceleration via the WZ method}
Elect. J. of Combinatorics
({\tt http://www.combinatorics.org}), 
{\bf 4(2)} [Wilf Festschrifft volume], R3 (4 pages) (1997).
 
103. (With T. Amdeberhan) {\it q-Apery Irrationality Proofs by q-WZ Pairs}, 
Adv. Appl. Math. {\bf 20}, 275-283, (1998).
 
104. (With D. Foata)
{\it A classic proof of a recurrence for a very classical sequence},
J. Combin. Theory Ser. A {\bf 80}, 380-384 (1997).

105. (With D. Foata)
{\it Combinatorial Proofs of Bass's Evaluations of the Ihara-Selberg 
Zeta function of a Graph}, Trans. Amer. Math. Soc., 
{\bf 351}, 2257--2274 (1999).
 
106. {\it The Abstract Lace Expansion}, Advances in Applied Mathematics,
{\bf 19}, 355-359 (1997).
 
107. (With I. Nemes, M. Petkovsek, and H. S. Wilf)
{\it How to do Monthly Problems on your computer}, Amer. Math. Monthly
{\bf 104}, 505-519 (1997).
 
108. {\it Dodgson's Determinant-Evaluation Rule Proved by TWO-TIMING MEN and
WOMEN}, Elect. J. of Combinatorics 
({\tt http://www.combinatorics.org})
{\bf 4(2)}, [Wilf Festschrift
volume], R22 (2 pages) (1997).
 
109. {\it A comparison of two methods for random labellings of balls
by vectors of integers},
Advances in Combinatorial Methods and Applications
to Probability and Statistics, N. Balakrishnan, ed., Birkhauser, 1997
(Mohanty Festschrift).
 
110.(With S. B. Ekhad)
{\it Proof of Conway's Lost Cosmological Theorem}
Elect. Res. Announcements of the AMS {\bf 3}, 78-82 (1997).
 
111. {\it 
Math Bite: Proof of an Empirical Observation Made by Amos Oz's character}, 
Math. Magazine {\bf 70 }, 291 (1997).
 
112. {\it How Much Should a Nineteenth-Century French Bastard Inherit},
J. Difference Eq. Appl. {\bf 3}, 385-388 (1998).
 
113. (With C. Krattenthaler)
{\it Proof of a Determinant Evaluation Conjectured by Bombieri, Hunt, and
van der Poorten}, New York J. of Math. (elec.)
({\tt http://nyjm.albany.edu/})
{\bf 3}, 54-102 (1997).

114. {\it Automated Counting of LEGO Towers}, J. Difference Eq. Appl.,
{\bf 5}, 323-333, (1999).
 
115. (With J. Noonan)
{\it The Goulden-Jackson Cluster Method: Extensions, Applications, and
Implementations}, J. Difference Eq. Appl.
{\bf 5}, 355-377, (1999).

116. (With  Scott Ahlgren, Shalosh B. Ekhad, Ken Ono)
{\it A Binomial Coefficient Identity Associated to a Conjecture of
Beukers}, Electronic Journal of Combinatorics

({\tt http://www.combinatorics.org}) {\bf 5}, R10 (1 page) (1998).

117. (With Aaron Robertson)
{\it A 2-Coloring of [1,N] Can Have $(1/22)N^2+O(N)$ Monochromatic
Schur Triples, But Not Less!}, 
Electronic Journal of Combinatorics

({\tt http://www.combinatorics.org}) {\bf 5} R19, (5 pages) (1998).

118. (With Shalosh B. Ekhad)
{\it There Are More Than 2**(n/17) n-Lettered Ternary Square-Free
Words}, J. Integer Sequences (elec.)
({\tt http://www.research.att.com/~njas/jit/}), {\bf 98.1.9} 
(3 pages) (1998).

119. {\it Enumeration Schemes, and More Importantly, 
Their Automatic Generation},
Annals of Combinatorics {\bf 2}, 185-195 (1998).

120. {\it Proof Of A Conjecture Of Chan, Robbins, and Yuen},
ETNA, (Elec. Trans, of Numerical Analysis) (elec.)
({\tt http://etna.mcs.kent.edu/})
{\bf 9}, 147-148, (1999).


121. (With Aaron Robertson and Herb Wilf) 
{\it Patterns and Fractions}, Elec. J. Combinatorics, 
{\bf 6},  ({\tt http://www.combinatorics.org})
R38, (4 pages) (1999).


122. (With S. B. Ekhad)
{\it PLANE GEOMETRY: An Elementary School Textbook (ca. 2050)}, 
Mathematical Intelligencer 
{\bf 21(3)}, 64-70, (1999).

123. {\it Symbol-Crunching with the Transfer-Matrix Method in Order to
 Count Skinny Physical Creatures},
 INTEGERS ({\tt http://www.integers-ejcnt.org}), {\bf 0} A9 (29 pages)
(2000).

124. (With A. Edlin)
{\it The Goulden-Jacskon Cluster Method For Cyclic Words},
Advances in Applied Mathematics  {\bf 25}, 228-232, (2000).

125. {\it The Umbral Transfer-Matrix Method: I. Foundations},
J. Comb. Theory Ser. A
{\bf 91}, 451-463, (Rota memorial issue) (2000).

126. {\it
   How Berger, Felzenbaum, and Fraenkel Revolutionized COVERING
   SYSTEMS The Same Way that George Boole Revolutionized LOGIC},
Elect. J. Combinatorics 8(2) (2001) (special issue in honor of
Aviezri Fraenkel), A1
 ({\tt http://www.combinatorics.org}), (9 pages).

127. (With D. Foata)
{\it Babson-Steingrimsson Statistics Are Indeed Mahonian
(and Sometimes Even Euler-Mahonian)},
 Adv. Appl. Math. {\bf 27} (2001), 390-404

128. {\it Three-Rowed CHOMP}, 
Adv. Appl. Math. {\bf 26} (2001), 168-179.

129. {\it The Umbral Transfer-Matrix Method. III. Counting Animals},
New York J of Mathematics 7(2001), 223-231.

130. (With T. Amdeberhan)
{\it Determinants Through The Looking Glass},
Adv. Appl. Math. {\bf 27} (2001), 225-230

131. {\it The Umbral Transfer-Matrix Method. IV. Counting Self-Avoiding
Polygons and Walks}, Elec. J. Comb. {\bf 8}(1)(2001), (22 pages) R28.

132. {\it The Umbral Transfer-Matrix Method. V. The Goulden-Jackson Cluster
Method for Infinitely Many Mistakes}, INTEGERS, {\bf 2} (2002), 
(10 pages), A5 .

133. (With D. Foata)
{\it The Collector's Brotherhood Problem Using the Newman-Shepp Symbolic
Method}, Algebra Universalis (special Rota memorial issue),
Algebra Universalis (special Rota memorial issue),{\bf 49} (2003), 387-395.

134. {\it ``Real'' Analysis is a Degenerate Case of Discrete Analysis},
Appeared in:
"New Progress in Difference Equations"(Proc. ICDEA 2001), edited by
Bernd Aulbach,
Saber Elaydi, and Gerry Ladas, and publisher by Taylor \& Francis, 
London, 2004. 


135. {\it Computerized Deconstruction}, Adv. Applied Math.
{\bf 30} (2003), 633-654.

136. (With Aaron Robertson, Dan Saracino)
{\it Refined Restricted Permutations}, Annals of Combinatorics.
{\bf 6} (2003), 427-444.

137. {\it Liebe Opa Paul, Ich Bin Auch Ein
Experimental Scientist}, 
Adv. Appl. Math. {\bf 30} (2003), 633-654.

138. {\it Towards a SymbolicComputational Philosophy (and
Methodology!) for Mathematics}, Proc. of the BuchbergerFest,
(Peter Paule, ed.), Springer, to appear.

139. (With Stavros Garoufalidis and Thang TQ Le)
{\it The Quantum MacMahon Master Theorem}, Proc. National Academy of Science, 
to appear.

140. {\it Chomp, Recurrences, and Chaos}, 
J. Difference Equations and its Applications
{\bf 8} (2004), 369-378.
[special issue in honor of Saber Elaydi.]

141. (With Xinyu Sun)
On Fraenkel's N-Heap Wythoff Conjecture,
Annals of Combinatorics {\bf 8} (2004). 225-238.

142. (With Mohamud Mohammed) {\it The Markov-WZ Method} 
Elec J. Combinatorics {\bf 11}(2004), R53. (14 pages).

143.{\it Symbolic Moment Calculus I.: Foundations and Permutation
Pattern Statistics}, Annals of Combinatorics {\bf 8} (2004), 369-378.

144. {\it Dave Robbins's Art of Guessing},
Adv. Appl. Math. {\bf 34} (2005), 939-954.

145. (With Mohamud Mohammed) 
{\it Sharp Upper Bounds for the Orders of the Recurrences Outputted by
the Zeilberger and q-Zeilberger Algorithms},
J. Symbolic Computation {\bf 39}  (2005), 201-207.

146. {\it Enumerative and Algebraic Combinatorics},
to appear in: `Princeton Companion of Mathematics',
T.W. Gowers, ed.

147. (With Arthur Benjamin)
Pythagorean Primes and Palindromic Continued Fractions,
INTEGERS {\bf 5(1)} (2005), A30.

148. (With Andrew V. Sills)
{\it Disturbing the Dyson Conjecture (in a GOOD Way)},
to appear in J. Experimental Mathematics.

149. {\it DECONSTRUCTING the ZEILBERGER algorithm},
J. Difference Equations and its Applications {\bf 11}
(2005), 851-856.

150.(With Moa Apagodu [formerly Mohamud Mohammed])
{\it Multi-Variable Zeilberger and Almkvist-Zeilberger Algorithms and the
Sharpening of Wilf-Zeilberger Theory },
Adv. Appl. Math. (Special Regev issue), to appear.

151. {\it Automatc CountTilings}, submitted.

152. {\it The HOLONOMIC ANSATZ I. Foundations and Applications to Lattice
Path Counting}, submitted

153. {\it The HOLONOMIC ANSATZ II.
Automatic DISCOVERY(!) and PROOF(!!) of Holonomic Determinant Evaluations},
Annals of Combinatorics, to appear.


154. {\it
Symbolic Moment Calculus II.: Why is Ramsey Theory Sooooo Eeeenormoulsy
Hard?}, submitted

155. (With Shalosh B. Ekhad, Vince Vatter)
{\it A Proof of the Loehr-Warrington Amazing TEN to the Power n Conjecture}.
submitted.

\bigskip
{\bf BOOKS:}
 
B1. (With M. Petkovsek and H. S. Wilf) {\it A=B}, AK Peters, Wellesley, (1996).

B2. {\it Shalosh B. Ekhad's 2050 Plane Geometry  Text},
(webbook, \hfill\break
{\tt http://www.math.rutgers.edu/\Tilde zeilberg/PG.html})

B3. {\it Shalosh B. Ekhad's Computer-Generated Alphametics},
(webbook, \hfill\break
{\tt http://www.math.rutgers.edu/\Tilde zeilberg/hans/hans.html})

\bigskip
{\bf BOOK REVIEWS:}
 
1. {\it Review of "The Umbral Calculus'' by S.Roman}, Bull. A.M.S., 
{\bf 13}, 73-76(1985).

2. {\it Review of "Proof and Confirmation'' by 
D. Bressoud}, Amer. Math. Monthly, Feb. 2001.

3. {\it Review of "Kepler's Problem'' by G. Szpiro},
Science {\bf 301}, 1086 (Aug. 29, 2003).

4. {\it Review of "Mathematics by Experiments'' by J. Borwein and D. Bailey},
Amer. Sci., March-April 2005, 182-183.
 
\bigskip
{\bf Ph.D. Thesis:}

{\it ``New Approaches and Results in the Theory of Discrete
Analytic Functions''}, Weizmann Institute of Science,
Revovot. Israel, Aug. 1976. Advisor: Harry Dym.
\bigskip
\bigskip
   
Last Update: March, 13 2006

\end
 




