Conference in honor of Doron Zeilberger's 60th Birthday
Sprache des Tagungstitel:
Sometimes we solve exciting combinatorial problems by a boring computation, and sometimes we solve boring combinatorial problems by an exciting computation. This talk is about an exciting combinatorial problem which was solved by an exciting computation: We give a proof of the long standing qTSPP conjecture in enumerative combinatorics. This proof is the result of a collaboration between Christoph Koutschan, Doron Zeilberger, and the speaker.