Computational and Theoretical Challenges on Counting Solid Standard Young Tableaux

Details Computational and Theoretical Challenges on Counting Solid Standard Young Tableaux Computational and Theoretical Challenges on Counting Solid Standard Young Tableaux

2012-02-28

arxiv.org/abs/1202.6229v1

Mathematics

Combinatorics

6 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Computational and Theoretical Challenges on Counting Solid Standard Young Tableaux does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computational and Theoretical Challenges on Counting Solid Standard Young Tableaux, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational and Theoretical Challenges on Counting Solid Standard Young Tableaux will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-610104