The following pages link to Doron Zeilberger (Q180279):
Displaying 50 items.
- The (ordinary) generating functions enumerating \(123\)-avoiding words with \(r\) occurrences of each of \(1, 2, \dots, n\) are always algebraic (Q295298) (← links)
- Automatic enumeration of generalized Ménage numbers (Q402609) (← links)
- Toward a language theoretic proof of the four color theorem (Q408127) (← links)
- Formulæ for the number of partitions of \(n\) into at most \(m\) parts (using the quasi-polynomial ansatz) (Q424536) (← links)
- Corrigendum to ``The Mahonian probability distribution on words is asymptotically normal'' (Q432494) (← links)
- The Mahonian probability distribution on words is asymptotically normal (Q534184) (← links)
- A Stembridge-Stanton style elementary proof of the Habsieger-Kadell q- Morris identity (Q584267) (← links)
- The 1958 Pekeris-Accad-WEIZAC ground-breaking collaboration that computed ground states of two-electron atoms (and its 2010 redux) (Q642135) (← links)
- A translation method for finding combinatorial bijections (Q659801) (← links)
- A simple rederivation of Onsager's solution of the 2D Ising model using experimental mathematics (Q666890) (← links)
- The enumeration of permutations with a prescribed number of ``forbidden'' patterns (Q675878) (← links)
- Identities in search of identity (Q688676) (← links)
- The computational challenge of enumerating high-dimensional rook walks (Q720594) (← links)
- Surprising relations between sums-of-squares of characters of the symmetric group over two-rowed shapes and over hook shapes (Q726489) (← links)
- A 21st century proof of Dougall's hypergeometric sum identity (Q750683) (← links)
- How likely is Polya's drunkard to stay in \(x\geq y\geq z\)? (Q751052) (← links)
- The method of differentiating under the integral sign (Q754021) (← links)
- Some asymptotic bijections (Q759752) (← links)
- A combinatorial proof of Newton's identities (Q790817) (← links)
- Garsia and Milne's bijective proof of the inclusion-exclusion principle (Q795832) (← links)
- A short Hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof (Q801062) (← links)
- An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)'') multisum/integral identities (Q811594) (← links)
- Multi-variable Zeilberger and Almkvist-Zeilberger algorithms and the sharpening of Wilf-Zeilberger theory (Q863306) (← links)
- 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 (Q870079) (← links)
- A fast algorithm for proving terminating hypergeometric identities (Q913796) (← links)
- A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number (Q913810) (← links)
- Using Rota's Umbral calculus to enumerate Stanley's \(P\)-partitions (Q931837) (← links)
- A symbolic computation approach to a problem involving multivariate Poisson distributions (Q962002) (← links)
- Efficient counting and asymptotics of \(k\)-noncrossing tangled diagrams (Q1010947) (← links)
- Commutation relations and Vandermonde determinants (Q1024325) (← links)
- A proof of Andrews' \(q\)-Dyson conjecture (Q1058634) (← links)
- (Q1065800) (redirect page) (← links)
- A direct combinatorial proof of a positivity result (Q1065801) (← links)
- A bijective proof of Cassini's Fibonacci identity (Q1066146) (← links)
- Resurrecting the asymptotics of linear recurrences (Q1066904) (← links)
- A combinatorial approach to matrix algebra (Q1086566) (← links)
- A \(q\)-Foata proof of the \(q\)-Saalschütz identity (Q1101450) (← links)
- Enumerating totally clean words (Q1109033) (← links)
- A lattice walk approach to the ''inv'' and ''maj'' q-counting of multiset permutations (Q1142214) (← links)
- Partial difference equations in \(m_1\geq m_2\geq \dots \geq m_n\geq 0\) and their applications to combinatorics (Q1146185) (← links)
- Some comments on Rota's umbral calculus (Q1147320) (← links)
- Enumeration of words by their number of mistakes (Q1152368) (← links)
- A short Rogers-Ramanujan bijection (Q1160180) (← links)
- Sister Celine's technique and its generalizations (Q1164046) (← links)
- A combinatorial proof of Dyson's conjecture (Q1167729) (← links)
- A holonomic systems approach to special functions identities (Q1173698) (← links)
- The method of creative telescoping (Q1176785) (← links)
- A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length \(n\) is \(2(3n)\)!/(\((n+1)\)!\((2n+1)\)!) (Q1193435) (← links)
- Gauss's \(_ 2F_ 1(1)\) cannot be generalized to \(_ 2F_ 1(x)\) (Q1196839) (← links)
- A new approach to the theory of discrete analytic functions (Q1233525) (← links)
