Doron Zeilberger
#2,927
Most Influential Person Now
Israeli mathematician
Doron Zeilberger's AcademicInfluence.com Rankings
Doron Zeilbergermathematics Degrees
Mathematics
#190
World Rank
#437
Historical Rank
Combinatorics
#8
World Rank
#9
Historical Rank
Measure Theory
#1027
World Rank
#1324
Historical Rank
Download Badge
Mathematics
Doron Zeilberger's Degrees
- Bachelors Mathematics Technion – Israel Institute of Technology
- Masters Mathematics Technion – Israel Institute of Technology
- PhD Mathematics Technion – Israel Institute of Technology
Similar Degrees You Can Earn
Why Is Doron Zeilberger Influential?
(Suggest an Edit or Addition)According to Wikipedia, Doron Zeilberger is an Israeli mathematician, known for his work in combinatorics. Education and career He received his doctorate from the Weizmann Institute of Science in 1976, under the direction of Harry Dym, with the thesis "New Approaches and Results in the Theory of Discrete Analytic Functions." He is a Board of Governors Professor of Mathematics at Rutgers University.
Doron Zeilberger's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- A holonomic systems approach to special functions identities (1990) (541)
- The Method of Creative Telescoping (1991) (470)
- An algorithmic proof theory for hypergeometric (ordinary and “q”) multisum/integral identities (1992) (431)
- Proof of the alternating sign matrix conjecture (1994) (288)
- A fast algorithm for proving terminating hypergeometric identities (1990) (276)
- Rational functions certify combinatorial identities (1990) (172)
- The Method of Differentiating under the Integral Sign (1990) (164)
- Resurrecting the asymptotics of linear recurrences (1985) (157)
- Random walk in a Weyl chamber (1992) (138)
- Multi-variable Zeilberger and Almkvist-Zeilberger algorithms and the sharpening of Wilf-Zeilberger theory (2006) (138)
- Denert's permutation statistic is indeed Euler-Mahonian (1990) (135)
- The Goulden—Jackson cluster method: extensions, applications and implementations (1998) (125)
- A Combinatorial Proof of Bass’s Evaluations of the Ihara-Selberg Zeta Function for Graphs (1998) (113)
- A proof of Julian West's conjecture that the number of two-stacksortable permutations of length n is 2(3n)!/((n + 1)!(2n + 1)!) (1992) (112)
- Proof of the refined alternating sign matrix conjecture. (1996) (108)
- The Enumeration of Permutations with a Prescribed Number of “Forbidden” Patterns (1996) (102)
- A combinatorial approach to matrix algebra (1985) (89)
- Theorems for a price: tomorrow’s semi-rigorous mathematical culture (1993) (85)
- A proof of Andrews' q-Dyson conjecture (2006) (84)
- Kathy O'Hara's constructive proof of the unimodality of the Gaussian polynomials (1989) (74)
- Laguerre Polynomials, Weighted Derangements, and Positivity (1988) (71)
- Dodgson's Determinant-Evaluation Rule Proved by TWO-TIMING MEN and WOMEN (1996) (69)
- Proof of Ira Gessel's lattice path conjecture (2008) (64)
- Proof of a Conjecture of Chan, Robbins, and Yuen (1998) (64)
- Hypergeometric series acceleration via the WZ method (1996) (63)
- Permutation Patterns and Continued Fractions (1999) (58)
- A Classic Proof of a Recurrence for a Very Classical Sequence (1997) (51)
- Andre's reflection proof generalized to the many-candidate ballot problem (1983) (50)
- Enumeration Schemes and, more importantly, their automatic generation (1998) (49)
- Refined Restricted Permutations (2002) (47)
- Sister Celine's technique and its generalizations (1982) (47)
- The quantum MacMahon Master Theorem (2003) (44)
- The Umbral Transfer-Matrix Method. I. Foundations (2000) (44)
- On Elementary Methods in Positivity Theory (1983) (44)
- A WZ proof of Ramanujan's Formula for Pi (1993) (43)
- Towards computerized proofs of identities (1990) (40)
- A combinatorial proof of Dyson's conjecture (1982) (40)
- Proof of George Andrews’s and David Robbins’s q-TSPP conjecture (2010) (36)
- On the Asymptotic Statistics of the Number of Occurrences of Multiple Permutation Patterns (2013) (36)
- Sharp upper bounds for the orders of the recurrences output by the Zeilberger and q-Zeilberger algorithms (2005) (36)
- How to do monthly problems with your computer (1997) (35)
- Rational function certification of multisum/integral/``$q$'' identities (1992) (34)
- A 2-Coloring of [1, N] Can Have (1/22)N2+O(N) Monochromatic Schur Triples, But Not less! (1998) (32)
- 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 (2006) (32)
- A q-Foata Proof of the q-Saalschütz Identity (1987) (30)
- Determinants through the Looking Glass (2001) (30)
- The Automatic Central Limit Theorems Generator (and Much More (2009) (30)
- Six etudes in generating functions (1989) (29)
- A Markov chain occurring in enzyme kinetics (1982) (29)
- A combinatorial proof of Newton's identities (1984) (29)
- Formulæ for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz) (2011) (28)
- A Pentagonal Number Sieve (1998) (28)
- The C-finite ansatz (2011) (27)
- A Bijective Proof of the Hook-Length Formula (1982) (26)
- “Real” Analysis Is a Degenerate Case of Discrete Analysis (2004) (26)
- Reverend Charles to the aid of Major Percy and Fields-Medalist Enrico (1995) (25)
- A short hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof (1984) (25)
- A One-Line High School Algebra Proof of the Unimodality of the Gaussian Polynomials [kn] for k < 20 (1989) (24)
- Symbolic Moment Calculus I: Foundations and Permutation Pattern Statistics (2004) (24)
- A Stembridge-Stanton style elementary proof of the Habsieger-Kadell q-Morris identity (1990) (24)
- The Holonomic Ansatz II. Automatic Discovery(!) And Proof(!!) of Holonomic Determinant Evaluations (2007) (24)
- Babson-Steingrı'msson Statistics are Indeed Mahonian (and Sometimes Even Euler-Mahonian) (2001) (24)
- Bijecting Euler's Partitions-Recurrence (1985) (24)
- The quasi-holonomic ansatz and restricted lattice walks (2008) (24)
- Graphical major indices (1996) (24)
- A Short Proof of Jacobi's Formula for the Number of Representations of an Integer as a Sum of Four Squares (1992) (24)
- A proof of the G 2 case of macdonald's root system-dyson conjecture (1987) (23)
- A maple program for proving hypergeometric identities (1991) (23)
- There are More Than 2**(n/17) n-Letter Ternary Square-Free Words (1998) (23)
- The Number of Solutions of X^2=0 in Triangular Matrices Over GF(q) (1995) (22)
- Using the “Freshman's Dream” to Prove Combinatorial Congruences (2016) (22)
- Enumerative and algebraic combinatorics (2010) (21)
- A Proof of George Andrews' and David Robbins' $q$-TSPP Conjecture (2010) (21)
- The Algebra of Linear Partial Difference Operators and Its Applications (1980) (20)
- Explicit Expressions for the Variance and Higher Moments of the Size of a Simultaneous Core Partition and its Limiting Distribution (2015) (20)
- Garsia and Milne's bijective proof of the inclusion-exclusion principle (1984) (20)
- On an Identity of Daubechies (1993) (19)
- Three Recitations on Holonomic Systems and Hypergeometric Series (1994) (19)
- Self Avoiding Walks, the Language of Science, and Fibonacci Numbers (1995) (18)
- A symbolic computation approach to a problem involving multivariate Poisson distributions (2009) (18)
- The Collector’s Brotherhood Problem using the Newman-Shepp symbolic method (2003) (18)
- The Mahonian probability distribution on words is asymptotically normal (2009) (18)
- Generalized Rogers-Ramanujan bijections (1989) (18)
- Disturbing the Dyson Conjecture (in a GOOD Way) (2006) (17)
- Chomp, Recurrences and Chaos(?) (2003) (17)
- A short Rogers-Ramanujan bijection (1982) (17)
- An enquiry concerning human (and computer!) [mathematical] understanding (2007) (17)
- Necessary conditions for distinct covering systems with square-free moduli (1991) (17)
- A bijective proof of Cassini's Fibonacci identity (1986) (17)
- A Binomial Coefficient Identity Associated to a Conjecture of Beukers (1998) (17)
- A case study in meta-automation: automatic generation of congruence automata for combinatorial sequences (2013) (17)
- Further properties of discrete analytic functions (1977) (17)
- A new approach to the theory of discrete analytic functions (1977) (16)
- The J.C.P. miller recurrence for exponentiating a polynomial, and its q- analog * (1995) (16)
- The Umbral Transfer-Matrix Method. IV. Counting Self-Avoiding Polygons and Walks (2001) (16)
- The Umbral Transfer-Matrix Method , III : Counting Animals (2001) (16)
- Symbol-crunching with the transfer-matrix method in order to count skinny physical creatures. (2000) (15)
- A new basis for discrete analytic polynomials (1977) (15)
- The irrationality measure of π is at most 7.103205334137… (2019) (15)
- Identities in Search of Identity (1993) (15)
- On the error in the numerical integration of Chebyshev polynomials (1971) (15)
- A Unified Approach to Macdonald’s Root-System Conjectures (1988) (15)
- Explicit expressions for the expectation, variance and higher moments of the size of a (2n + 1, 2n + 3)-core partition with distinct parts (2017) (14)
- Polynomial Reduction and Super Congruences (2019) (14)
- The Ehrhart polynomial of the Birkhoff polytope (2004) (14)
- HISTABRUT: A Maple Package for Symbol-Crunching in Probability theory (2010) (13)
- Efficient Counting and Asymptotics of k-Noncrossing Tangled Diagrams (2008) (13)
- The Markov-WZ Method (2004) (13)
- A combinatorial interpretation of the integral of the product of Legendre polynomials (1988) (13)
- A bijection from ordered trees to binary trees that sends the pruning order to the strahler number (1990) (13)
- A Constant Term Identity Featuring the Ubiquitous (and Mysterious) Andrews-Mills-Robbins-Rumsey Numbers 1, 2, 7, 42, 429, (1994) (13)
- The computational challenge of enumerating high-dimensional rook walks (2010) (13)
- Automatic Generation of Theorems and Proofs on Enumerating Consecutive-Wilf Classes (2011) (12)
- Enumeration of words by their number of mistakes (1981) (12)
- Proof of Conway’s lost cosmological theorem (1997) (12)
- The Number of Inversions and the Major Index of Permutations are Asymptotically Joint-Independently Normal (2010) (12)
- Integrals Involving Rudin-Shapiro Polynomials and Sketch of a Proof of Saffari's Conjecture (2016) (12)
- Combinatorial Proofs of Capelli's and Turnbull's identities from Classical Invariant Theory (1993) (12)
- The odlyzko conjecture and o’hara’s unimodality proof (1989) (12)
- Proof of a conjecture on multisets of hook numbers (1997) (12)
- Math Bite: A Generalization of a Curiosity that Feynman Remembered All His Life (1996) (11)
- The Method of Undetermined Generalization and Specialization Illustrated with Fred Galvin's Amazing Proof of the Dinitz Conjecture (1995) (11)
- Proof of a determinant evaluation conjectured by Bombieri, Hunt and van der Poorten (1998) (11)
- How to generate as many Somos-like miracles as you wish† (2013) (11)
- q-Apéry Irrationality Proofs byq-WZ Pairs (1998) (11)
- Computerized deconstruction (2003) (11)
- Toward a language theoretic proof of the four color theorem (2010) (10)
- Gauss's 2 F 1 (1) cannot be generalized to 2 F 1 ( x ) (1992) (10)
- Using Noonan-Zeilberger Functional Equations to enumerate (in polynomial time!) generalized Wilf classes (2012) (10)
- Automated discovery and proof of congruence theorems for partial sums of combinatorial sequences (2015) (10)
- Curing the andrews syndrome (1998) (10)
- A 21st century proof of Dougall's hypergeometric sum identity (1990) (10)
- Searching for Strange Hypergeometric Identities By Sheer Brute Force (2008) (10)
- On Vince Vatter’s Brilliant Extension of Doron Zeilberger’s Enumeration Schemes for Herb Wilf ’s Classes (1999) (10)
- The Holonomic Ansatz I. Foundations and Applications to Lattice Path Counting (2007) (9)
- The (Ordinary) Generating Functions Enumerating 123-Avoiding Words with r Occurrences of Each of 1, 2, . . . , n Are Always Algebraic (2014) (9)
- Automatic Counting of Restricted Dyck Paths via (Numeric and Symbolic) Dynamic Programming (2020) (9)
- A Translation Method for Finding Combinatorial Bijections (2009) (9)
- Rademacher's infinite partial fraction conjecture is (almost certainly) false (2011) (9)
- The umbral transfer-matrix method. V: The Goulden-Jackson cluster method for infinitely many mistakes. (2002) (9)
- A NEW PROOF TO EHRENPREIS'S SEMILOCAL QUOTIENT STRUCTURE THEOREM. (1978) (9)
- How Berger, Felzenbaum and Fraenkel Revolutionized Covering - Systems the Same Way that George Boole Revolutionized Logic (2000) (9)
- Explicit (Polynomial!) Expressions for the Expectation, Variance and Higher Moments of the Size of a (2n + 1, 2n + 3)-core partition with Distinct Parts (2016) (9)
- Symbolic moment calculus II: Why is Ramsey theory sooooo eeeenormously hard? (2007) (8)
- A Computer Algebra Approach to the Discrete Dirichlet Problem (1994) (8)
- A Proof of George Andrews' and Dave Robbins' q-TSPP Conjecture (modulo a finite amount of routine calculations) (2008) (8)
- Dave Robbins' art of guessing (2005) (8)
- Toward a combinatorial proof of the Jacobian conjecture (1986) (8)
- The Goulden-Jackson Cluster Method for Cyclic Words (2000) (8)
- Uniqueness theorems for harmonic functions of exponential growth (1976) (8)
- Three-Rowed CHOMP (2001) (8)
- A lattice walk approach to the “inv” and “maj” q-counting of multiset permutations (1980) (8)
- Alexander Burstein's Lovely Combinatorial Proof of John Noonan's Beautiful Formula that the number of n-permutations that contain the Pattern 321 Exactly Once Equals (3/n)(2n)!/((n-3)!(n+3)!) (2011) (7)
- Pompeiu's problem on discrete space. (1978) (7)
- A Direct Combinatorial Proof of a Positivity Result (1983) (7)
- A combinatorial-probabilistic analysis of bitcoin attacks* (2018) (7)
- The 1958 Pekeris-Accad-WEIZAC Ground-Breaking Collaboration that Computed Ground States of Two-Electron Atoms (and its 2010 Redux) (2010) (7)
- T.L. Hill's graphical method for solving linear equations (1982) (7)
- Chu's 1303 Identity Implies Bombieri's 1990 Norm-Inequality [via an Identity of Beauzamy and D\'egot] (1993) (7)
- Automated counting of lego towers (1998) (7)
- Some comments on Rota's Umbral Calculus (1980) (7)
- Automatic conjecturing and proving of exact values of some infinite families of infinite continued fractions (2020) (7)
- Tweaking the Beukers integrals in search of more miraculous irrationality proofs a la Apéry (2021) (6)
- Algorithms for permutation statistics (2011) (6)
- Pythagorean primes and palindromic continued fractions. (2005) (6)
- Two Dimensional Directed Lattice Walks with Boundaries (2007) (6)
- An Experimental Mathematics Perspective on the Old, and still Open, Question of When To Stop? (2009) (6)
- Experiments with a Positivity-Preserving Operator (2007) (6)
- A Proof of the Loehr-Warrington Amazing TEN to the Power n Conjecture (2005) (6)
- Patterns and Fractions (1999) (6)
- Using Rota's Umbral calculus to enumerate Stanley's P-partitions (2008) (6)
- Zeroless arithmetic: representing integers ONLY using ONE (2013) (6)
- Partial difference equations in m1>=m2>= ... >=mn>=0 and their applications to combinatorics (1980) (5)
- A High-School Algebra and high-school (purely formal) calculus,. Wallet-Sized Proof, of the Bieberbach Conjecture [after L. Weinstein] (1994) (5)
- Going Back to Neil Sloane's FIRST LOVE (OEIS Sequence A435): On the Total Heights in Rooted Labeled Trees (2016) (5)
- Multibasic Eulerian polynomials (1991) (5)
- MONOCHROMATIC SCHUR TRIPLES , BUT NOT LESS ! (1998) (5)
- Automatic discovery of irrationality proofs and irrationality measures (2019) (5)
- Doron Gepner's Statistics on Words in {1,2,3} is (most probably) Asymptotically Logistic (2016) (5)
- Discrete analytic functions of exponential growth (1977) (5)
- Identities in character tables of Sn (2015) (5)
- A maple program that finds, and proves, recurrences and differential equations satisfied by hyperexponential definite integrals (1991) (5)
- Binary operations in the set of solutions of a partial difference equation (1977) (5)
- How likely is Polya's drunkard to stay in x⩾ y⩾z? (1989) (5)
- The Generating Functions Enumerating 12..d-Avoiding Words with r occurrences of each of 1,2, ... , n are D-finite for all d and all r (2014) (5)
- Corrigendum to "The Mahonian probability distribution on words is asymptotically normal" [Adv. in Appl. Math. 46 (1-4) (2011) 109-124] (2012) (5)
- Linearization coefficients for the Jacobi polynomials. (1987) (5)
- A Detailed Analysis of Quicksort Running Time (2019) (5)
- Generalizing and Implementing Michael Hirschhorn's Amazing Algorithm for Proving Ramanujan-Type Congruences (2013) (5)
- The Abstract Lace Expansion (1997) (5)
- Towards a WZ evolution of the Mehta integral (1994) (4)
- On the number of Singular Vector Tuples of Hyper-Cubical Tensors (2016) (4)
- Proof of a q-Analog of a Constant Term Identity Conjectured by Forrester (1994) (4)
- On a conjecture of R. J. Simpson about exact covering congruences (1989) (4)
- The number of solutions of in triangular matrices over . (1996) (4)
- All binomial identities are verifiable. (1981) (4)
- WZ-STYLE CERTIFICATION AND SISTER CELINE'S TECHNIQUE FOR ABEL-TYPE SUMS (2007) (4)
- Increasing consecutive patterns in words (2018) (4)
- Sketch of a Proof of an Intriguing Conjecture of Karola Meszaros and Alejandro Morales Regarding the Volume of the $D_n$ Analog of the Chan-Robbins-Yuen Polytope (Or: The Morris-Selberg Constant Term Identity Strikes Again!) (2014) (4)
- The Amazing $3^n$ Theorem and its even more Amazing Proof [Discovered by Xavier G. Viennot and his \'Ecole Bordelaise gang] (2012) (4)
- Improved algorithms and implementations in the multi-wz theory (2000) (4)
- The number of 1...d-avoiding permutations of length d+r for SYMBOLIC d but numeric r (2015) (4)
- Automatic Enumeration of Generalized Menage Numbers (2014) (4)
- The "Monkey Typing Shakespeare" Problem for Compositions (2019) (4)
- A new algorithm for proving global asymptotic stability of rational difference equations (2011) (3)
- Two Definite Integrals That Are Definitely (and Surprisingly!) Equal (2019) (3)
- A symbolic finite-state approach for automated proving of theorems in combinatorial game theory (2007) (3)
- Surprising Relations Between Sums-Of-Squares of Characters of the Symmetric Group Over Two-Rowed Shapes and Over Hook Shapes (2015) (3)
- The Reciprocal of ∑ n ≥ 0 a n b n for non-commuting a and b , Catalan numbers and non-commutative quadratic equations (2013) (3)
- Automated Proof (or Disproof) of Linear Recurrences Satisfied by Pisot Sequences (2016) (3)
- Answers to Some Questions about Explicit Sinkhorn Limits posed by Mel Nathanson (2019) (3)
- How joe gillis discovered combinatorial special function theory (1994) (3)
- Deconstructing the Zeilberger algorithm† (2005) (3)
- On the Intriguing Problem of Counting (n+1,n+2)-Core Partitions into Odd Parts (2017) (3)
- Numerical and Symbolic Studies of the Peaceable Queens Problem (2019) (3)
- Analysis of the Gift Exchange Problem (2017) (3)
- On the Average Maximal Number of Balls in a Bin Resulting from Throwing r Balls into n Bins T times (2019) (3)
- How to Extend Karolyi and Nagy's BRILLIANT Proof of the Zeilberger-Bressoud q-Dyson Theorem in order to Evaluate ANY Coefficient of the q-Dyson Product (2013) (3)
- Automatic Proofs of Asymptotic ABNORMALITY (and much more!) of Natural Statistics Defined on Catalan-Counted Combinatorial Families (2014) (2)
- An Empirical Method for Solving (rigorously!) Algebraic Functional Equations Of the Form F(P(x,t), P(x,1),x,t)=0 (2014) (2)
- Factorization of C-finite Sequences (2016) (2)
- A Treatise on Sucker's Bets (2017) (2)
- Automatic CounTilings (2006) (2)
- The Method(!) of "Guess and Check" (2015) (2)
- On the number of walks on a regular Cayley tree (2009) (2)
- Experimenting with Apéry Limits and WZ pairs (2021) (2)
- IV.18 Enumerative and Algebraic Combinatorics (2010) (2)
- The Number of Permutations With A Prescribed Number of 132 and 123 Patterns (1999) (2)
- Some Asymptotic Bijections (1985) (2)
- Boolean Function Analogs of Covering Systems (2018) (2)
- Odd-Rule Cellular Automata on the Square Grid (2015) (2)
- In How Many Ways Can You Reassemble Several Russian Dolls (2009) (2)
- A Motivated Rendition of the Ellenberg-Gijswijt Gorgeous proof that the Largest Subset of $F_3^n$ with No Three-Term Arithmetic Progression is $O(c^n)$, with $c=\root 3 \of {(5589+891\,\sqrt {33})}/8=2.75510461302363300022127...$ (2016) (2)
- Pick Up Sticks (2012) (2)
- On The Limiting Distributions of the Total Height On Families of Trees (2017) (2)
- To Prove the Optimal Packing (2003) (2)
- Using GENERATINGFUNCTIONOLOGY to Enumerate Distinct-Multiplicity Partitions (2012) (2)
- Two Quick Proofs of a Catalan Lemma Needed by Lisa Sauermann and Yuval Wigderson (2020) (2)
- Automatic Solution of Richard Stanley's Amer. Math. Monthly Problem #11610 and ANY Problem of That Type (2011) (2)
- A multi-computational exploration of some games of pure chance (2019) (2)
- Solutions of exponential growth to systems of partial differential equations (1979) (2)
- D.H. Lehmer’s Tridiagonal Determinant: An Étude in (Andrews-Inspired) Experimental Mathematics (2018) (2)
- A Meta-Algorithm for Creating Fast Algorithms for Counting ON Cells in Odd-Rule Cellular Automata (2015) (2)
- An Experimental Mathematics Approach to the Area Statistic of Parking Functions (2018) (2)
- Computerizing the Andrews-Fraenkel-Sellers Proofs on the Number of m-ary partitions mod m (and doing MUCH more!) (2015) (2)
- A Heterosexual Mehler Formula for the Straight Hermite Polynomials (A La Foata) (1998) (2)
- Human and automated approaches for finite trigonometric sums (2022) (2)
- An Experimental Mathematics Approach to the Area Statistic of Parking Functions (2019) (1)
- A bijectional attack on the Razumov-Stroganov conjecture (2008) (1)
- Analogs of Collatz ’ s Notorious 3 x + 1 Conjecture (2009) (1)
- Two Questions about the Fractional Counting of Partitions (2018) (1)
- Searching for Apery-Style Miracles [Using, Inter-Alia, the Amazing Almkvist-Zeilberger Algorithm] (2014) (1)
- Wilf's "Snake Oil" Method Proves an Identity in The Motzkin Triangle (2015) (1)
- An Explicit Formula for the Number of Solutions of X^2=0 in Triangular Matrices over a Finite Field (1995) (1)
- Counting Standard Young Tableaux With Restricted Runs (2020) (1)
- Some Deep and Original Questions about the"critical exponents"of Generalized Ballot Sequences (2021) (1)
- How to gamble if you're in a hurry (2011) (1)
- Talmudic Lattice Path Counting (1994) (1)
- Commutation relations and Vandermonde determinants (2009) (1)
- What Is Mathematics and What Should It Be (2017) (1)
- A Simple Rederivation of Onsager’s Solution of the 2D Ising Model Using Experimental Mathematics (2018) (1)
- The Absent-Minded Passengers Problem via Computer Algebra (2020) (1)
- Computational and Theoretical Challenges on Counting Solid Standard Young Tableaux (2012) (1)
- Enumerating totally clean words (1987) (1)
- Some Remarks on a recent article by J. -P. Allouche (2019) (1)
- The Collector ' s (1)
- "Trivializing" Generalizations of some Izergin-Korepin-type Determinants (2007) (1)
- New Aspects Concerning “Meerzwiebel - Scillae Bulbus” DAB 9 (1991) (1)
- Automated Proofs of Many Conjectured Recurrences in the OEIS made by R.J. Mathar (2017) (1)
- On Invariance Properties of Entries of Matrix Powers (2021) (1)
- Untying the Gordian Knot via Experimental Mathematics (2018) (1)
- Automated Generation of Generating Functions Related to Generalized Stern's Diatomic Arrays in the footsteps of Richard Stanley (2021) (1)
- An Explicit Conjectured Determinant Evaluation Whose Proof Would Make Me Happy (and the OEIS richer) (2014) (1)
- Automatic Generation of Convolution Identities for C-finite sequences (2021) (1)
- Automated discovery and proof in three combinatorial problems (2009) (1)
- WZ Theory, Chapter II (1998) (1)
- The Discrete Analog of the Malgrange–Ehrenpreis Theorem (2011) (1)
- There are $(r+1)(r+2)(2r+3)(r^2+3r+5)$ Ways For the Four Teams of a World Cup Group to Each Have $r$ Goals For and $r$ Goals Against [Thanks to the Soccer Analog of Prop. 4.6.19 of Richard Stanley's (Classic!) EC1] (2014) (1)
- A Short Proof of McDougall's Circle Theorem (2014) (1)
- Finite Analogs of Szemer\'edi's Theorem (2009) (1)
- Two Motivated Concrete Proofs (much better than the usual one) that the Square-Root of 2 is Irrational (2014) (1)
- In How many ways can I carry a total of n coins in my two pockets, and have the same amount in both pockets? (2019) (1)
- Automatic Generation of Generating Functions for Chromatic Polynomials for Grid Graphs (and more general creatures) of Fixed (but arbitrary!) Width (2011) (1)
- A Generalization of Odlyzko's Conjecture: the Coefficients of (1 - q) j / ((1 - q 2n ) ⋯(1 - q 2n+2j )) Alternate in Sign (1993) (1)
- Introduction: Classical Combinatorics: Special Issue in Honor of Dominique Foata (2001) (0)
- On the Statistics of the Number of Fixed-Dimensional Subcubes in a Random Subset of the n-Dimensional Discrete Unit Cube (2023) (0)
- The C-finite Ansatz Meets the Holonomic Ansatz (2015) (0)
- A Very Short (Bijective!) Proof of Touchard's Catalan Identity (2015) (0)
- Experimenting with the Dym-Luks Ball and Cell Game (almost) Sixty Years Later (2023) (0)
- Bijecting Euler’s Partition Recurrence (2009) (0)
- Increasing consecutive patterns in words (2019) (0)
- Counting Clean Words According to the Number of Their Clean Neighbors (2023) (0)
- Farewell to "W" (Herbert Saul Wilf), a true VISIONARY for whom EVERYTHING was INTERTWINED (2012) (0)
- The Reciprocal of $\sum_{n\geq 0}a^nb^n$ for non-commuting $a$ and $b$, Catalan numbers and non-commutative quadratic equations (2012) (0)
- Automated Counting and Statistical Analysis of Labeled Trees with Degree Restrictions (2022) (0)
- A generalization of Odlyzko’s conjecture: the coefficients of (1-)^{}/((1-²ⁿ)\cdots(1-^{2+2})) alternate in sign (1993) (0)
- Some Nice Sums are Almost as Nice if you turn them Upside Down (2009) (0)
- The Dayenu Boolean Function Is Almost Always True (2017) (0)
- Normalized Iterated Averaging Polygons (2018) (0)
- A Bijective Proof of Richard Stanley's Observation that the sum of the cubes of the n-th row of Stern's Diatomic array equals 3 times 7 to the power n-1 (2021) (0)
- An Experimental (yet fully rigorous!) Study of a certain"Measure Of Disarray"that 12-year Noga Alon Proved was always Even (2021) (0)
- A computer algebra approach to partial difference equations (1995) (0)
- HOW TO PROVE GEORGE ANDREWS’ AND DAVE ROBBINS’ q-TSPP CONJECTURE (2009) (0)
- A Quick Empirical Reproof of the Asymptotic Normality of the Hirsch Citation Index (First proved by Canfield, Corteel, and Savage) (2014) (0)
- The Average AMS fellow who died before Aug. 2022 lived 83.36 years, published 98.53 papers, and was cited 2473.23 times (2022) (0)
- Symbolic-computational methods in combinatorial game theory and ramsey theory (2008) (0)
- MORE HYPERGEOMETRIC IDENTITIES RELATED TO RAMANUJAN-TYPE SERIES (2012) (0)
- Ju n 19 94 GRAPHICAL MAJOR INDICES (1995) (0)
- FLEXIBLE SCHEMES AND BEYOND: EXPERIMENTAL ENUMERATION OF PATTERN AVOIDANCE CLASSES (2020) (0)
- Automatic counting of tilings of skinny plane regions (2012) (0)
- 2 6 Ja n 20 07 Two Dimensional Directed Lattice Walks with Boundaries (2008) (0)
- Balls in Boxes: Variations on a Theme of Warren Ewens and Herbert Wilf (2011) (0)
- MATH BITE : CONSTRUCTING EFFICIENT PARTICLE ACCELERATORS : IS AS EASY AS 1+ 1 = 2 (THANKS TO VLADIMIR VISNJIC) (1999) (0)
- On the maximal minimal cube lengths in distinct DNF tautologies (2019) (0)
- Systematic Counting of Restricted Partitions. (2019) (0)
- ${5\choose 2}$ Proofs that ${n\choose k} \leq {n\choose {k+1}}$ if $k (2010) (0)
- Automatic Solving of Cubic Diophantine Equations Inspired by Ramanujan (2020) (0)
- A Comparison Of Two Methods For Random Labelling of Balls by Vectors of Integers (1998) (0)
- A discrete analogue of the Paley-Wiener theorem for bounded analytic functions in a half plane (1977) (0)
- NSF Proposal: Automated Enumerative Combinatorics Automated Enumerative Combinatorics (2013) (0)
- A Variation on a Very Familiar Algorithm. (1981) (0)
- On Euler's "Misleading Induction", Andrews' "Fix", and How to Fully Automate them (2013) (0)
- RIGOROUS EXPERIMENTAL COMBINATORICS : PROJECT DESCRIPTION (2008) (0)
- Towards a Symbolic Computational Philosophy (and Methodology!) for Mathematics (2013) (0)
- There are EXACTLY 1493804444499093354916284290188948031229880469556 Ways to Derange a Standard Deck of Cards (ignoring suits) [and many other such useful facts] (2021) (0)
- How Much Should a 19th-Century French Bastard Inherit (1998) (0)
- PROOF OF A CONJECTURE OF GESSEL (2008) (0)
- A Linear Time, and Constant Space, Algorithm to Compute the Mixed Moments of the Multivariate Normal Distributions (2022) (0)
- Counting condorcet (2022) (0)
- Review: Steven Roman, The umbral calculus (1985) (0)
- Against rigor (2010) (0)
- A Summation Identity: 10575 (1999) (0)
- A differential view of hypergeometric functions: algorithms and implementations (1993) (0)
- Searching for Disjoint Covering Systems with Precisely One Repeated Modulus (2015) (0)
- A Eulogy for Jack Good (2009) (0)
- Using Symbolic Computation to analyze some Children's Board Games (2019) (0)
- Self Avoiding Walks , The Language 1 of Science , and Fibonacci Numbers (2021) (0)
- A Simple Rederivation of Onsager’s Solution of the 2D Ising Model Using Experimental Mathematics (2018) (0)
- Small Deviations of Sums of Random Variables by Brian Garnett Dissertation Director : Swastik Kopparty (2016) (0)
- Reviews (2001) (0)
- Aufgabe VII.47 of Polya-Szego Implies Robbins's Multi-Integral Evaluation (1998) (0)
- The C-finite ansatz (2012) (0)
- How many Dice Rolls Would It Take to Reach Your Favorite Kind of Number? (2023) (0)
- Bijections for an identity of Young Tableaux (2010) (0)
- A Short Proof of a Ptolemy-Like Relation for an Even number of Points on a Circle Discovered by Jane McDougall (2013) (0)
- A Mathematical Analysis of Mathematical Faculty (2020) (0)
- C O ] 2 7 O ct 2 00 9 Finite Analogs of Szemerédi ’ s Theorem (2009) (0)
- A 2-coloring of can have monochromatic Schur triples, but not less. (1998) (0)
- Curing the Andrews syndrom (1998) (0)
- A Mathematical Analysis Of Mathematical Salaries and More (2019) (0)
- Variations on the Missionaries and Cannibals Problem (2022) (0)
- Automatic counting of generalized Latin rectangles and trapezoids (2021) (0)
- 3 Counting Condorcet Vote-Count Profiles (2022) (0)
- RADEMACHER ’ S INFINITE PARTIAL FRACTION CONJECTURE IS FALSE (2011) (0)
- A Multi-Set Identity for Partitions (2009) (0)
- Automated Counting of Towers (À La Bordelaise) [Or: Footnote to p. 81 of the Flajolet-Sedgewick Chef-d'œvre] (2012) (0)
- Automating John P. D'Angelo's method to study Complete Polynomial Sequences (2021) (0)
- GRAPHICAL MAJOR (1995) (0)
- Relations Between Sums-Of-Squares of Characters of the Symmetric Group Over Two-Rowed Shapes and Over Hook Shapes By (2018) (0)
- Experimenting with Standard Young Tableaux (2023) (0)
- The (Ordinary) Generating Functions Enumerating 123-Avoiding Words with r Occurrences of Each of 1, 2, . . . , n Are Always Algebraic (2016) (0)
- An elegant Multi-Integral that implies an even more elegant determinant identity of Dougherty and McCammond (2022) (0)
- Partitions and Pentagonal Numbers: 10628 (2000) (0)
- WALLET-SIZED PROOF , OF THE BIEBERBACHCONJECTURE [ After (1993) (0)
- The Combinatorial Astrology of Rabbi Abraham Ibn Ezra (1998) (0)
- AN EXPERIMENTAL WALK IN PATTERNS, PARTITIONS, AND WORDS (2020) (0)
- Counting permutations where the difference between entries located r places apart can never be s (for any given positive integers r and s) (2022) (0)
- Computer-generated conjectures(!) and proofs(!!) in combinatorial game theory (abstract only) (2008) (0)
- A THESIS SUBMITTED TO THE FACULTY OF THE GRADUATE SCHOOL OF THE UNIVERSITY OF MINNESOTA BY HUNG QUANG NGO IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE (2001) (0)
- How Many Rounds Should You Expect in Urn Solitaire (2018) (0)
- Enumerative Geometrical Genealogy (Or: The Sex Life of Points and Lines) (2014) (0)
- On Rademacher ’ s Infinite Partial Fraction Conjecture (2011) (0)
- The Graphical Major Index (1994) (0)
- Experimental methods applied to the computation of integer sequences (2009) (0)
- C O ] 2 2 Se p 20 09 A Multiset Identity for Partitions (2009) (0)
- FIVE APPLICATIONS OF WILF-ZEILBERGER THEORY TO ENUMERATION AND PROBABILITY (2007) (0)
- Teaching the computer how to discover(!) and then prove(!!) (all by itself(!!!)) analogues of Collatz's notorious 3x + 1 conjecture (2009) (0)
- A high-school algebra wallet-sized proof, of the Bieberbach conjecture After L. Weinstein] (1993) (0)
- Research Announcement: a Computer-generated Proof That P=np (0)
- Opinion: [Contemporary pure] Math is dar less than the sum of its [too numerous] parts (2013) (0)
- Special Issue: Symbolic Computation in Combinatorics - Foreword of the Guest Editors (1992) (0)
- Math bite: Proof of an empirical observation made by a character of Amos Oz (1997) (0)
- C O ] 2 0 O ct 2 01 9 Systematic Counting of Restricted Partitions (2019) (0)
- Gauss ’ s & 1 ) cannot be generalized to $ ‘ A x ) (1990) (0)
- Linear-Time and Constant-Space Algorithms to compute Multi-Sequences that arise in Enumerative Combinatorics (and Elsewhere) (2022) (0)
- Counting Permutations that Avoid Many Patterns (2017) (0)
- In Memoriam: Rodica Simion (1955-2000) (2002) (0)
- Gene Transfer-based Phylogenetics: Analytical Expressions and Additivity via Birth–Death Theory (2022) (0)
- Exploring general Apéry limits via the Zudilin–Straub t-transform (2022) (0)
This paper list is powered by the following services:
Other Resources About Doron Zeilberger
What Schools Are Affiliated With Doron Zeilberger?
Doron Zeilberger is affiliated with the following schools:
