# Tag Archives: partitions

## Polynomials and Representations VII

Our next task is as follows: Given partition and vector , count the number of semistandard Young tableaux with shape and type (i.e. occurs times). Proposition. The number of SSYT with shape and type remains invariant when we permute the … Continue reading

## Polynomials and Representations VI

For now, we will switch gears and study the combinatorics of the matrices and where run over all partitions of d>0. Eventually, we will show that there is a matrix K such that: where J is the permutation matrix swapping and its transpose. … Continue reading

## Polynomials and Representations V

It was clear from the earlier articles that n (number of variables ) plays a minimal role in the combinatorics of the symmetric polynomials. Hence, removing the parameter n turns out to be quite convenient; the process gives us the formal ring of symmetric functions. … Continue reading

## Polynomials and Representations IV

Power Sum Polynomials The power sum polynomial is defined as follows: In this case, we do not define , although it seems natural to set As before, for a partition define: Note that we must have above since we have … Continue reading

## Polynomials and Representations III

Complete Symmetric Polynomials Corresponding to the elementary symmetric polynomial, we define the complete symmetric polynomials in to be: For example when , we have: Thus, written as a sum of monomial symmetric polynomials, we have Note that while the elementary symmetric polynomials only go … Continue reading

## Polynomials and Representations II

More About Partitions Recall that a partition is a sequence of weakly decreasing non-negative integers, where appending or dropping ending zeros gives us the same partition. A partition is usually represented graphically as a table of boxes or dots: We will … Continue reading