91 citations · 520 across the 230 of their papers we have counts for
6 papers · 1 filter
A bijectional attack on the Razumov-Stroganov conjecture
Arvind Ayyer, Doron Zeilberger
We attempt to prove the Razumov-Stroganov conjecture using a bijectional approach. We have been unsuccessful but we believe the techniques we present can be used to prove the conje…
A Proof of George Andrews' and Dave Robbins' q-TSPP Conjecture (modulo a finite amount of routine calculations)
Manuel Kauers, Christoph Koutschan, Doron Zeilberger
In the historic conference Combinatoire Enumerative[LL] wonderfully organized by Gilbert Labelle and Pierre Leroux there were many stimulating lectures, including a very interestin…
The Quasi-Holonomic Ansatz and Restricted Lattice Walks
Manuel Kauers, Doron Zeilberger
The great enumerator Germain Kreweras empirically discovered this intriguing fact, and then needed lots of pages[K], and lots of human ingenuity, to prove it. Other great enumerato…
Proof of Ira Gessel's Lattice Path Conjecture
Manuel Kauers, Christoph Koutschan, Doron Zeilberger
We present a computer-aided, yet fully rigorous, proof of Ira Gessel's tantalizingly simply-stated conjecture that the number of ways of walking steps in the region $x+y \geq…
Searching for Strange Hypergeometric Identities By Sheer Brute Force
Moa Apagodu, Doron Zeilberger
We describe a systematic search for all strange hypergeometric identities up to a certain complexity with sheer brute force that lead us to the discovery of two new infinite famili…
Efficient Counting and Asymptotics of -noncrossing tangled-diagrams
William Y. C. Chen, Jing Qin, Christian M. Reidys +1
In this paper we enumerate -noncrossing tangled-diagrams. A tangled-diagram is a labeled graph whose vertices are have degree , and are arranged in increasing o…