5 citations · 15 across the 9 of their papers we have counts for
Showing 2008Show all
3 papers · 1 filter
math.CO2008★ 5 cited
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…
math.CO2008★ 3 cited
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…
math.CO2008
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…