## Properties of Garnir Elements from Tableaux 2

When we pick a tableau with a certain row descent and use it to pick sets and , as we’ve done, the resulting Garnir element is a sum of a bunch of tabloids coming from a bunch of tableaux. I say that the column tabloid corresponding to the original tableau is dominated by all the other tabloids, using the column dominance order.

Indeed, when considering column tabloids we can rearrange the entries within columns freely, so we may assume that they’re always increasing down the columns. If we have our row descent in row , we can label the entries in the left column by s and those in the right column by s. Our tabloid then looks — in these two columns, at least — something like

We see our sets and . The permutations in the transversal that we use to construct our Garnir element work by moving swapping some of the s with some of the s. But since all that s are smaller than all the s, while they occur in a row further to the right, the dominance lemma for column tabloids tells us that any such swap can only move the tabloid up in the dominance order.

It is in this sense that the Garnir element lets us replace a tabloid with a linear combination of other tabloids that are “more standard”. And it puts us within striking distance of our goal.

[…] “Straightening” a Polytabloid Let’s look at one example of “straightening” out a polytabloid to show it’s in the span of the standard polytabloids, using the Garnir elements. […]

Pingback by “Straightening” a Polytabloid « The Unapologetic Mathematician | January 25, 2011 |

[…] suppose that it does have a row descent, which would keep it from being semistandard. Just like the last time we saw row descents, we get a chain of distinct elements running up the two […]

Pingback by Intertwinors from Semistandard Tableaux Span, part 2 « The Unapologetic Mathematician | February 12, 2011 |