Computational and Theoretical Challenges on Counting Solid Standard Young Tableaux

Doron Zeilberger, Shalosh B. XIV Ekhad

Publication date: 28 February 2012

Abstract: In how many ways can you place n chocolate pieces all of different sizes in an n by n chocolate box, in such a way that when you go from left to right and from top to bottom, there are no gaps AND the sizes increase along each row and each column? The answer is the well-known OEIS Sequence Number 85. To our amazement, the analogous sequence for a three-dimensional chocolate box was not there. Here we fill this gap, and more importantly, offer some computational and theoretical challenges about enumerating families of Solid Standard Young Tableaux.

This page was built for publication: Computational and Theoretical Challenges on Counting Solid Standard Young Tableaux