 | 2007 |
|---|
| 46 |       | Tewodros Amdeberhan,
Doron Zeilberger:
"Trivializing" Generalizations of some Izergin-Korepin-type Determinants.
Discrete Mathematics & Theoretical Computer Science 9(1): (2007) |
| 45 | | Arvind Ayyer,
Doron Zeilberger:
The Number of [Old-Time] Basketball Games with Final Score n: n where the Home Team was Never Losing but also Never Ahead by More Than w Points.
Electr. J. Comb. 14(1): (2007) |
| 2006 |
|---|
| 44 | | Doron Zeilberger,
David M. Bressoud:
A proof of Andrews' q-Dyson conjecture.
Discrete Mathematics 306(10-11): 1039-1059 (2006) |
| 43 | | Doron Zeilberger:
A fast algorithm for proving terminating hypergeometric identities.
Discrete Mathematics 306(10-11): 1072-1075 (2006) |
| 2005 |
|---|
| 42 | | Mohamud Mohammed,
Doron Zeilberger:
Sharp upper bounds for the orders of the recurrences output by the Zeilberger and q-Zeilberger algorithms.
J. Symb. Comput. 39(2): 201-207 (2005) |
| 2004 |
|---|
| 41 | | Mohamud Mohammed,
Doron Zeilberger:
The Markov-WZ Method.
Electr. J. Comb. 11(1): (2004) |
| 2001 |
|---|
| 40 | | Doron Zeilberger:
The Umbral Transfer-Matrix Method. IV. Counting Self-Avoiding Polygons and Walks.
Electr. J. Comb. 8(1): (2001) |
| 39 | | Doron Zeilberger:
How Berger, Felzenbaum and Fraenkel Revolutionized Covering - Systems the Same Way that George Boole Revolutionized Logic.
Electr. J. Comb. 8(2): (2001) |
| 2000 |
|---|
| 38 | | Doron Zeilberger:
The Umbral Transfer-Matrix Method. I. Foundations.
J. Comb. Theory, Ser. A 91(1-2): 451-463 (2000) |
| 1999 |
|---|
| 37 | | Aaron Robertson,
Herbert S. Wilf,
Doron Zeilberger:
Permutation Patterns and Continued Fractions.
Electr. J. Comb. 6: (1999) |
| 1998 |
|---|
| 36 | | Aaron Robertson,
Doron Zeilberger:
A 2-Coloring of [1, N] Can Have (1/22)N2+O(N) Monochromatic Schur Triples, But Not less!
Electr. J. Comb. 5: (1998) |
| 35 | | Scott Ahlgren,
Shalosh B. Ekhad,
Ken Ono,
Doron Zeilberger:
A Binomial Coefficient Identity Associated to a Conjecture of Beukers.
Electr. J. Comb. 5: (1998) |
| 34 | | Sylvie Corteel,
Carla D. Savage,
Herbert S. Wilf,
Doron Zeilberger:
A Pentagonal Number Sieve.
J. Comb. Theory, Ser. A 82(2): 186-192 (1998) |
| 1997 |
|---|
| 33 | | Doron Zeilberger:
Dodgson's Determinant-Evaluation Rule Proved by TWO-TIMING MEN and WOMEN.
Electr. J. Comb. 4(2): (1997) |
| 32 | | Tewodros Amdeberhan,
Doron Zeilberger:
Hypergeometric series acceleration via the WZ method.
Electr. J. Comb. 4(2): (1997) |
| 31 | | Dominique Foata,
Doron Zeilberger:
A Classic Proof of a Recurrence for a Very Classical Sequence.
J. Comb. Theory, Ser. A 80(2): 380-384 (1997) |
| 1996 |
|---|
| 30 | | Shalosh B. Ekhad,
Doron Zeilberger:
The Number of Solutions of X^2=0 in Triangular Matrices Over GF(q).
Electr. J. Comb. 3(1): (1996) |
| 29 | | Doron Zeilberger:
Proof of the alternating sign matrix conjecture.
Electr. J. Comb. 3(2): (1996) |
| 1995 |
|---|
| 28 |  | Doron Zeilberger:
Three Recitations on Holonomic Systems and Hypergeometric Series.
J. Symb. Comput. 20(5/6): 699-724 (1995) |
| 1994 |
|---|
| 27 | | Dominique Foata,
Doron Zeilberger:
Combinatorial Proofs of Capelli's and Turnbull's identities from Classical Invariant Theory.
Electr. J. Comb. 1: (1994) |
| 26 | | Doron Zeilberger:
A Constant Term Identity Featuring the Ubiquitous (and Mysterious) Andrews-Mills-Robbins-Rumsey Numbers 1, 2, 7, 42, 429, ...
J. Comb. Theory, Ser. A 66(1): 17-27 (1994) |
| 25 | | Doron Zeilberger:
Proof of a q-Analog of a Constant Term Identity Conjectured by Forrester.
J. Comb. Theory, Ser. A 66(2): 311-312 (1994) |
| 24 | | Jane Friedman,
Ira M. Gessel,
Doron Zeilberger:
Talmudic Lattice Path Counting.
J. Comb. Theory, Ser. A 68(1): 215-217 (1994) |
| 23 | | Craig R. Orr,
Doron Zeilberger:
A Computer Algebra Approach to the Discrete Dirichlet Problem.
J. Symb. Comput. 18(1): 87-90 (1994) |
| 1993 |
|---|
| 22 | | Doron Zeilberger:
Identities in Search of Identity.
Theor. Comput. Sci. 117(1&2): 23-38 (1993) |
| 1992 |
|---|
| 21 | | Doron Zeilberger:
A proof of Julian West's conjecture that the number of two-stacksortable permutations of length n is 2(3n)!/((n + 1)!(2n + 1)!).
Discrete Mathematics 102(1): 85-93 (1992) |
| 20 | | Peter Paule,
Doron Zeilberger:
Special Issue: Symbolic Computation in Combinatorics - Foreword of the Guest Editors.
J. Symb. Comput. 14(2/3): 123-126 (1992) |
| 1991 |
|---|
| 19 | | Doron Zeilberger:
The Method of Creative Telescoping.
J. Symb. Comput. 11(3): 195-204 (1991) |
| 1990 |
|---|
| 18 | | Doron Zeilberger:
A Stembridge-Stanton style elementary proof of the Habsieger-Kadell q-Morris identity.
Discrete Mathematics 79(3): 313-322 (1990) |
| 17 | | Doron Zeilberger:
A fast algorithm for proving terminating hypergeometric identities.
Discrete Mathematics 80(2): 207-211 (1990) |
| 16 | | Doron Zeilberger:
A bijection from ordered trees to binary trees that sends the pruning order to the strahler number.
Discrete Mathematics 82(1): 89-92 (1990) |
| 15 | | Gert Almkvist,
Doron Zeilberger:
The Method of Differentiating under the Integral Sign.
J. Symb. Comput. 10(6): 571-592 (1990) |
| 1988 |
|---|
| 14 | | Dominique Foata,
Doron Zeilberger:
Laguerre Polynomials, Weighted Derangements, and Positivity.
SIAM J. Discrete Math. 1(4): 425-433 (1988) |
| 1987 |
|---|
| 13 | | Doron Zeilberger:
Enumerating totally clean words.
Discrete Mathematics 64(2-3): 313-315 (1987) |
| 1986 |
|---|
| 12 | | M. Werman,
Doron Zeilberger:
A bijective proof of Cassini's Fibonacci identity.
Discrete Mathematics 58(1): 109 (1986) |
| 1985 |
|---|
| 11 | | Doron Zeilberger,
David M. Bressoud:
A proof of Andrews' q-Dyson conjecture.
Discrete Mathematics 54(2): 201-224 (1985) |
| 10 | | Doron Zeilberger:
A combinatorial approach to matrix algebra.
Discrete Mathematics 56(1): 61-72 (1985) |
| 1984 |
|---|
| 9 | | Doron Zeilberger:
A combinatorial proof of Newton's identities.
Discrete Mathematics 49(3): 319 (1984) |
| 8 | | Doron Zeilberger:
A short hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof.
Discrete Mathematics 51(1): 101-108 (1984) |
| 7 | | Doron Zeilberger:
Garsia and Milne's bijective proof of the inclusion-exclusion principle.
Discrete Mathematics 51(1): 109-110 (1984) |
| 1983 |
|---|
| 6 | | Doron Zeilberger:
Andre's reflection proof generalized to the many-candidate ballot problem.
Discrete Mathematics 44(3): 325-326 (1983) |
| 1982 |
|---|
| 5 | | David M. Bressoud,
Doron Zeilberger:
A short Rogers-Ramanujan bijection.
Discrete Mathematics 38(2-3): 313-315 (1982) |
| 4 | | Doron Zeilberger:
A combinatorial proof of Dyson's conjecture.
Discrete Mathematics 41(3): 317-321 (1982) |
| 3 | | Deborah S. Franzblau,
Doron Zeilberger:
A Bijective Proof of the Hook-Length Formula.
J. Algorithms 3(4): 317-343 (1982) |
| 1981 |
|---|
| 2 | | Doron Zeilberger:
Enumeration of words by their number of mistakes.
Discrete Mathematics 34(1): 89-91 (1981) |
| 1980 |
|---|
| 1 | | Doron Zeilberger:
Partial difference equations in m1>=m2>= ... >=mn>=0 and their applications to combinatorics.
Discrete Mathematics 31(1): 65-77 (1980) |
