Slides of this talk (PDF)
We use the algebra of difference operators (which we introduce as a
discrete analogue of differential operators) in order to prove the
enumeration formula for totally symmetric plane partitions (TSPP), whose
proof by hand is highly nontrivial (Stembridge 1995). Our computer
algebra (holonomic systems) approach is a computational challenge that
became feasible only by using new techniques. The remarkable point in
our new proof of TSPP is that the same technique can be applied to the
generalized problem q-TSPP which is still an outstanding open problem in
enumerative combinatorics
|