Given a Permutation of , the bumping algorithm constructs a standard Young Tableau by inserting the one by one into an already constructed Young Tableau. To apply the bumping algorithm, start with , which is a Young Tableau. If through have already been inserted, then in order to insert , start with the first line of the already constructed Young Tableau and search for the first element of this line which is greater than . If there is no such element, append to the first line and stop. If there is such an element (say, ), exchange for , search the second line using , and so on.

**References**

Skiena, S. *Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica.*
Reading, MA: Addison-Wesley, 1990.

© 1996-9

1999-05-26