Proof of George Andrews’s and David Robbins’s q -TSPP conjecture

2010/02/28 by Christoph Koutschan, Manuel Kauers, Doron Zeilberger · 1 citation
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Art #Art history #Combinatorics #Conjecture #George (robot) #Mathematical economics #Mathematics #Philosophy #Polynomial and algebraic computation #cs.SC #math.CO #msc:05A15 #msc:33F10

paper · pdf · doi:10.1073/pnas.1019186108

published as Proceedings of the National Academy of Sciences 108(6), pp. 2196-2199. 2011. ISSN 0027-8424

openalex publication_date 2011/01/24 · arxiv created 2012/12/06 · arxiv updated 2015/03/13 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05

Abstract

The conjecture that the orbit-counting generating function for totally symmetric plane partitions can be written as an explicit product formula has been stated independently by George Andrews and David Robbins around 1983. We present a proof of this long-standing conjecture.

Citations

• A Proof of George Andrews' and Dave Robbins' q-TSPP Conjecture (modulo a finite amount of routine calculations)
• A holonomic systems approach to special functions identities

Cited by

• Proof of the Density Threshold Conjecture for Pinwheel Scheduling

Related

• A Proof of George Andrews' and Dave Robbins' q-TSPP Conjecture (modulo a finite amount of routine calculations)
• Eliminating Human Insight: An Algorithmic Proof of Stembridge's TSPP Theorem
• On refined enumerations of totally symmetric self-complementary plane partitions I
• Elementary Proof of MacMahon's Conjecture
• Determinant identities and a generalization of the number of totally symmetric self-complementary plane partitions