Macaulay2 » Documentation
Packages » SpechtModule :: straighteningAlgorithm
next | previous | forward | backward | up | index | toc

straighteningAlgorithm -- an algorithm for expressing any polytabloid as linear combinations of standard polytabloids

Synopsis

Description

The straigtening algorithm works by finding the first term that is not standard. Then, taking as coordinates the first row descent, it calculates the Garnir element of this tableaux. It then rewrites the SpechtModuleElement substituting the term by the linear combination given by the garnir element.

i1 : p = new Partition from {3,2,1}

o1 = Partition{3, 2, 1}

o1 : Partition
i2 : y = youngTableau(p,{1,2,3,5,4,6})

o2 = | 1 2 3 |
     | 5 4 |
     | 6 |

o2 : YoungTableau
i3 : garnirElement y

o3 = - | 1 2 3 | + | 1 2 3 | + | 1 4 3 | - | 1 4 3 | + | 1 5 3 | + | 1 2 3 |
       | 4 5 |     | 4 6 |     | 2 5 |     | 2 6 |     | 2 6 |     | 5 4 |
       | 6 |       | 5 |       | 6 |       | 5 |       | 4 |       | 6 |

o3 : SpechtModuleElement

See also

Ways to use straighteningAlgorithm :

For the programmer

The object straighteningAlgorithm is a method function.