The following pages link to Doron Zeilberger (Q180279):
Displaying 50 items.
- Analysis of the gift exchange problem (Q2363700) (← links)
- The \(C\)-finite ansatz (Q2376847) (← links)
- The holonomic ansatz. I: Foundations and applications to lattice path counting (Q2385105) (← links)
- The holonomic ansatz. II: Automatic discovery(!) and proof(!!) of holonomic determinant evaluations (Q2385106) (← links)
- Sharp upper bounds for the orders of the recurrences output by the Zeilberger and \(q\)-Zeilberger algorithms (Q2456541) (← links)
- Dave Robbins' art of guessing (Q2483921) (← links)
- The collector's brotherhood problem using the Newman-Shepp symbolic method (Q2496173) (← links)
- A proof of Andrews' \(q\)-Dyson conjecture. (Reprint) (Q2498002) (← links)
- A fast algorithm for proving terminating hypergeometric identities. (Reprint) (Q2498005) (← links)
- Tweaking the Beukers integrals in search of more miraculous irrationality proofs a la Apéry (Q2673054) (← links)
- The umbral transfer-matrix method. V: The Goulden-Jackson cluster method for infinitely many mistakes (Q2778469) (← links)
- Identities in character tables of<i>S</i><sub><i>n</i></sub> (Q2804536) (← links)
- Herbert S. Wilf (1931--2012) (Q2813103) (← links)
- Automated discovery and proof of congruence theorems for partial sums of combinatorial sequences (Q2816619) (← links)
- Automatic Generation of Theorems and Proofs on Enumerating Consecutive-Wilf Classes (Q2846957) (← links)
- Balls in Boxes: Variations on a Theme of Warren Ewens and Herbert Wilf (Q2846959) (← links)
- Zeroless arithmetic: representing integers ONLY using ONE (Q2868945) (← links)
- Automatic counting of tilings of skinny plane regions (Q2875862) (← links)
- A Fibonacci-counting proof begged by Benjamin and Quinn (Q2883417) (← links)
- Some nice sums are almost as nice if you turn them upside down (Q2905213) (← links)
- A Short Proof of McDougall’s Circle Theorem (Q2928619) (← links)
- The Reciprocal of ∑_{𝑛≥0}𝑎ⁿ𝑏ⁿ for non-commuting 𝑎 and 𝑏, Catalan numbers and non-commutative quadratic equations (Q2947474) (← links)
- (Q2988094) (← links)
- Teaching the computer how to discover(!) and then prove(!!) (all by itself(!!!)) analogues of Collatz's notorious 3<i>x</i> + 1 conjecture (Q2997148) (← links)
- The Odlyzko Conjecture and O'Hara's Unimodality Proof (Q3035288) (← links)
- An Experimental Mathematics Perspective on the Old, and still Open, Question of When To Stop? (Q3062305) (← links)
- Finite Analogs of Szemer\'edi's Theorem (Q3062311) (← links)
- Proof of Ira Gessel's lattice path conjecture (Q3069219) (← links)
- (Q3139680) (← links)
- (Q3139681) (← links)
- On an Identity of Daubechies (Q3139923) (← links)
- (Q3348913) (← links)
- (Q3377496) (← links)
- Untying the Gordian Knot via Experimental Mathematics (Q3387118) (← links)
- Disturbing the Dyson Conjecture (in a GOOD Way) (Q3428104) (← links)
- Rational Functions Certify Combinatorial Identities (Q3470469) (← links)
- Necessary conditions for distinct covering systems with square-free moduli (Q3474694) (← links)
- (Q3480042) (← links)
- The quasi-holonomic ansatz and restricted lattice walks (Q3534870) (← links)
- (Q3588135) (← links)
- Experiments with a Positivity-Preserving Operator (Q3598053) (← links)
- A symbolic finite-state approach for automated proving of theorems in combinatorial game theory (Q3600655) (← links)
- Two Dimensional Directed Lattice Walks with Boundaries (Q3602564) (← links)
- (Q3602581) (← links)
- Searching for Strange Hypergeometric Identities By Sheer Brute Force (Q3628994) (← links)
- The Automatic Central Limit Theorems Generator (and Much More!) (Q3656251) (← links)
- Bijecting Euler's Partitions-Recurrence (Q3695324) (← links)
- On Elementary Methods in Positivity Theory (Q3733444) (← links)
- (Q3758831) (← links)
- A Proof of the $G_2 $ Case of Macdonald’s Root System-Dyson Conjecture (Q3784074) (← links)
