6 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.SC2009
Eliminating Human Insight: An Algorithmic Proof of Stembridge's TSPP Theorem
Christoph Koutschan
We present a new proof of Stembridge's theorem about the enumeration of totally symmetric plane partitions using the methodology suggested in the recent Koutschan-Kauers-Zeilberger…
math.CO2008★ 6 cited
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…