Doron Zeilberger

Affiliations:
  • Rutgers University, Department of Mathematics, Piscataway, NJ, USA


According to our database1, Doron Zeilberger authored at least 102 papers between 1980 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Enumerating seating arrangements that obey social distancing.
J. Symb. Comput., 2025

2024
Experimenting with Standard Young Tableaux.
Math. Comput. Sci., July, 2024

von Neumann and Newman Pokers with Finite Decks.
CoRR, 2024

2023
Counting Clean Words According to the Number of Their Clean Neighbors.
ACM Commun. Comput. Algebra, March, 2023

How Many Dice Rolls Would It Take to Hit Your Favorite Kind of Number?
Maple Trans., 2023

Using Generating Functions to Prove Additivity of Gene-Neighborhood Based Phylogenetics - Extended Abstract.
Proceedings of the Bioinformatics Research and Applications - 19th International Symposium, 2023

2022
Numerical and Symbolic Studies of the Peaceable Queens Problem.
Exp. Math., 2022

Exploring General Apéry Limits via the Zudilin-Straub t-transform.
CoRR, 2022

2021
Experimenting with Apéry Limits and WZ pairs.
Maple Trans., 2021

A multi-computational exploration of some games of pure chance.
J. Symb. Comput., 2021

Polynomial reduction and supercongruences.
J. Symb. Comput., 2021

There are EXACTLY 1493804444499093354916284290188948031229880469556 Ways to Derange a Standard Deck of Cards (ignoring suits) [and many other such useful facts].
CoRR, 2021

2019
Polynomial Reduction and Super Congruences.
CoRR, 2019

On the maximal minimal cube lengths in distinct DNF tautologies.
CoRR, 2019

2018
On The Limiting Distributions of the Total Height On Families of Trees.
Integers, 2018

A Combinatorial-Probabilistic Analysis of Bitcoin Attacks.
CoRR, 2018

A Simple Re-Derivation of Onsager's Solution of the 2D Ising Model using Experimental Mathematics.
CoRR, 2018

2017
Using the "Freshman's Dream" to Prove Combinatorial Congruences.
Am. Math. Mon., 2017

Analysis of the Gift Exchange Problem.
Electron. J. Comb., 2017

2016
Factorization of C-finite Sequences.
CoRR, 2016

2014
A Short Proof of McDougall's Circle Theorem.
Am. Math. Mon., 2014

2013
Using Noonan-Zeilberger Functional Equations to enumerate (in polynomial time!) generalized Wilf classes.
Adv. Appl. Math., 2013

Automatic counting of tilings of skinny plane regions.
Proceedings of the Surveys in Combinatorics 2013, 2013

2012
Farewell to "W" (Herbert Saul Wilf), a true VISIONARY for whom EVERYTHING was INTERTWINED.
ACM Commun. Comput. Algebra, 2012

Formulæ for the number of partitions of <i>n</i> into at most <i>m</i> parts (using the quasi-polynomial ansatz).
Adv. Appl. Math., 2012

Toward a language theoretic proof of the four color theorem.
Adv. Appl. Math., 2012

Corrigendum to "The Mahonian probability distribution on words is asymptotically normal" [Adv. in Appl. Math. 46 (1-4) (2011) 109-124].
Adv. Appl. Math., 2012

2011
A New Algorithm for Proving Global Asymptotic Stability of Rational Difference Equations
CoRR, 2011

How to Gamble If You're In a Hurry.
CoRR, 2011

The computational challenge of enumerating high-dimensional rook walks.
Adv. Appl. Math., 2011

The Mahonian probability distribution on words is asymptotically normal.
Adv. Appl. Math., 2011

2010
The 1958 Pekeris-Accad-WEIZAC Ground-Breaking Collaboration that computed Ground States of Two-Electron Atoms (and its 2010 Redux)
CoRR, 2010

Proof of George Andrews's and David Robbins's q-TSPP Conjecture.
CoRR, 2010

A symbolic computation approach to a problem involving multivariate Poisson distributions.
Adv. Appl. Math., 2010

Against Rigor.
Proceedings of the Intelligent Computer Mathematics, 10th International Conference, 2010

2009
Commutation relations and Vandermonde determinants.
Eur. J. Comb., 2009

Efficient Counting and Asymptotics of k-Noncrossing Tangled Diagrams.
Electron. J. Comb., 2009

2008
Experiments with a Positivity-Preserving Operator.
Exp. Math., 2008

Computer-generated conjectures(!) and proofs(!!) in combinatorial game theory (abstract only).
ACM Commun. Comput. Algebra, 2008

Using Rota's Umbral calculus to enumerate Stanley's <i>P</i>-partitions.
Adv. Appl. Math., 2008

2007
"Trivializing" Generalizations of some Izergin-Korepin-type Determinants.
Discret. Math. Theor. Comput. Sci., 2007

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.
Electron. J. Comb., 2007

2006
Disturbing the Dyson Conjecture (in a GOOD Way).
Exp. Math., 2006

A proof of Andrews' <i>q</i>-Dyson conjecture.
Discret. Math., 2006

A fast algorithm for proving terminating hypergeometric identities.
Discret. Math., 2006

Multi-variable Zeilberger and Almkvist-Zeilberger algorithms and the sharpening of Wilf-Zeilberger theory.
Adv. Appl. Math., 2006

2005
Sharp upper bounds for the orders of the recurrences output by the Zeilberger and q-Zeilberger algorithms.
J. Symb. Comput., 2005

Dave Robbins' art of guessing.
Adv. Appl. Math., 2005

2004
The Markov-WZ Method.
Electron. J. Comb., 2004

2003
Computerized deconstruction.
Adv. Appl. Math., 2003

Liebe Opa Paul, ich bin auch ein experimental Scientist!
Adv. Appl. Math., 2003

2002
In Memoriam: Rodica Simion (1955-2000).
Adv. Appl. Math., 2002

2001
How Berger, Felzenbaum and Fraenkel Revolutionized Covering - Systems the Same Way that George Boole Revolutionized Logic.
Electron. J. Comb., 2001

The Umbral Transfer-Matrix Method. IV. Counting Self-Avoiding Polygons and Walks.
Electron. J. Comb., 2001

Three-Rowed CHOMP.
Adv. Appl. Math., 2001

Introduction: Classical Combinatorics: Special Issue in Honor of Dominique Foata.
Adv. Appl. Math., 2001

Babson-Steingrı'msson Statistics are Indeed Mahonian (and Sometimes Even Euler-Mahonian).
Adv. Appl. Math., 2001

Determinants through the Looking Glass.
Adv. Appl. Math., 2001

2000
Partitions and Pentagonal Numbers: 10628.
Am. Math. Mon., 2000

The Umbral Transfer-Matrix Method. I. Foundations.
J. Comb. Theory A, 2000

The Goulden-Jackson Cluster Method for Cyclic Words.
Adv. Appl. Math., 2000

1999
Permutation Patterns and Continued Fractions.
Electron. J. Comb., 1999

1998
A Pentagonal Number Sieve.
J. Comb. Theory A, 1998

A 2-Coloring of [1, N] Can Have (1/22)N2+O(N) Monochromatic Schur Triples, But Not less!
Electron. J. Comb., 1998

A Binomial Coefficient Identity Associated to a Conjecture of Beukers.
Electron. J. Comb., 1998

1997
A Classic Proof of a Recurrence for a Very Classical Sequence.
J. Comb. Theory A, 1997

Dodgson's Determinant-Evaluation Rule Proved by TWO-TIMING MEN and WOMEN.
Electron. J. Comb., 1997

Hypergeometric series acceleration via the WZ method.
Electron. J. Comb., 1997

1996
Proof of the alternating sign matrix conjecture.
Electron. J. Comb., 1996

The Number of Solutions of X^2=0 in Triangular Matrices Over GF(q).
Electron. J. Comb., 1996

1995
Three Recitations on Holonomic Systems and Hypergeometric Series.
J. Symb. Comput., 1995

1994
A Computer Algebra Approach to the Discrete Dirichlet Problem.
J. Symb. Comput., 1994

Proof of a q-Analog of a Constant Term Identity Conjectured by Forrester.
J. Comb. Theory A, 1994

A Constant Term Identity Featuring the Ubiquitous (and Mysterious) Andrews-Mills-Robbins-Rumsey Numbers 1, 2, 7, 42, 429, ...
J. Comb. Theory A, 1994

Talmudic Lattice Path Counting.
J. Comb. Theory A, 1994

Combinatorial Proofs of Capelli's and Turnbull's identities from Classical Invariant Theory.
Electron. J. Comb., 1994

1993
Identities in Search of Identity.
Theor. Comput. Sci., 1993

1992
Special Issue: Symbolic Computation in Combinatorics - Foreword of the Guest Editors.
J. Symb. Comput., 1992

A proof of Julian West's conjecture that the number of two-stacksortable permutations of length n is 2(3n)!/((n + 1)!(2n + 1)!).
Discret. Math., 1992

1991
The Method of Creative Telescoping.
J. Symb. Comput., 1991

A maple program for proving hypergeometric identities.
SIGSAM Bull., 1991

A maple program that finds, and proves, recurrences and differential equations satisfied by hyperexponential definite integrals.
SIGSAM Bull., 1991

1990
The Method of Differentiating under the Integral Sign.
J. Symb. Comput., 1990

A bijection from ordered trees to binary trees that sends the pruning order to the strahler number.
Discret. Math., 1990

A Stembridge-Stanton style elementary proof of the Habsieger-Kadell q-Morris identity.
Discret. Math., 1990

1988
Laguerre Polynomials, Weighted Derangements, and Positivity.
SIAM J. Discret. Math., 1988

1987
A q-Foata Proof of the q-Saalschütz Identity.
Eur. J. Comb., 1987

Enumerating totally clean words.
Discret. Math., 1987

1986
A bijective proof of Cassini's Fibonacci identity.
Discret. Math., 1986

1985
Some Asymptotic Bijections.
J. Comb. Theory A, 1985

A proof of Andrews' q-Dyson conjecture.
Discret. Math., 1985

A combinatorial approach to matrix algebra.
Discret. Math., 1985

1984
A combinatorial proof of Newton's identities.
Discret. Math., 1984

Garsia and Milne's bijective proof of the inclusion-exclusion principle.
Discret. Math., 1984

A short hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof.
Discret. Math., 1984

1983
A Direct Combinatorial Proof of a Positivity Result.
Eur. J. Comb., 1983

Andre's reflection proof generalized to the many-candidate ballot problem.
Discret. Math., 1983

1982
A Bijective Proof of the Hook-Length Formula.
J. Algorithms, 1982

A combinatorial proof of Dyson's conjecture.
Discret. Math., 1982

A short Rogers-Ramanujan bijection.
Discret. Math., 1982

1981
Enumeration of words by their number of mistakes.
Discret. Math., 1981

1980
Partial difference equations in m<sub>1</sub>>=m<sub>2</sub>>= ... >=m<sub>n</sub>>=0 and their applications to combinatorics.
Discret. Math., 1980


  Loading...