Bumping Algorithm
Given a Permutation 
of 
, the bumping algorithm constructs a standardYoung Tableau by inserting the 
one by one into an already constructed Young Tableau. To apply the bumpingalgorithm, start with 
, which is a Young Tableau. If 
through 
have already been inserted, then inorder to insert 
, start with the first line of the already constructed Young Tableau and search for the firstelement 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.
- Good Path
- Good Prime
- Goodstein Sequence
- Goodstein's Theorem
- Googol
- Googolplex
- Gordon Function
- Gorenstein Ring
- Gosper Island
- Gosper's Algorithm
- Gosper's Method
- Graceful Graph
- Graded Algebra
- Gradian
- Gradient
- Gradient Four-Vector
- Gradient Theorem
- Graeco-Latin Square
- Graeco-Roman Square
- Graeffe's Method
- Graham's Biggest Little Hexagon
- Graham's Number
- Gram-Charlier Series
- Gram Determinant
- Gram Matrix