activity
19982011
most citedA Proof of George Andrews' and Dave Robbins' q-TSPP Conjecture (modulo a finite amount of routine calculations)

6 citations · 25 across the 23 of their papers we have counts for

collaborators
Showing math.DSShow all

1 paper · 1 filter

math.DS2007

A Symbolic Finite-state approach for Automated Proving of Theorems in Combinatorial Game Theory

Thotsaporn ``Aek'' Thanatipanonda, Doron Zeilberger

We develop a finite-state automata approach, implemented in a Maple package {\tt ToadsAndFrogs} available from our websites, for conjecturing, and then rigorously proving, values f…