Eliminating Human Insight: An Algorithmic Proof of Stembridge's TSPP Theorem

zbMATH Open1209.05017arXiv0906.1018MaRDI QIDQ3062303FDOQ3062303

Christoph Koutschan

Publication date: 3 January 2011

Abstract: 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 semi-rigorous proof of the Andrews-Robbins q-TSPP conjecture. Our proof makes heavy use of computer algebra and is completely automatic. We describe new methods that make the computations feasible in the first place. The tantalizing aspect of this work is that the same methods can be applied to prove the q-TSPP conjecture (that is a q-analogue of Stembridge's theorem and open for more than 25 years); the only hurdle here is still the computational complexity.

Full work available at URL: https://arxiv.org/abs/0906.1018

zbMATH Keywords

totally symmetric plane partitionTSPP

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17)

Cited In (3)

• The Robbins problem: computer proofs and human proofs
• A fast approach to creative telescoping
• Creative Telescoping for Holonomic Functions

This page was built for publication: Eliminating Human Insight: An Algorithmic Proof of Stembridge's TSPP Theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3062303)