-
Recent Posts
Archives
- March 2023
- January 2023
- May 2020
- April 2020
- March 2020
- June 2018
- July 2016
- June 2016
- May 2016
- March 2015
- February 2015
- January 2015
- December 2014
- December 2013
- November 2013
- July 2013
- June 2013
- May 2013
- March 2013
- February 2013
- January 2013
- December 2012
- November 2012
- October 2012
- September 2012
- August 2012
- April 2012
- March 2012
- February 2012
- January 2012
- December 2011
- November 2011
- October 2011
Categories
Meta
Pages
Tag Archives: rsk correspondence
Polynomials and Representations XX
From now onwards, we will assume the base field K has characteristic 0. Example: d=3 Following the previous article, we examine the case of . We get 3 partitions: , and Let us compute for all From the previous article, we have: Since , is … Continue reading
Polynomials and Representations XVII
Two Important Results In this article and the next, we will find a combinatorial way of computing the Littlewood-Richardson coefficient. The key result we have so far is that given any word w there is a unique SSYT T (called the rectification of … Continue reading
Polynomials and Representations IX
Hall Inner Product Let us resume our discussion of symmetric polynomials. First we define an inner product on d-th component of the formal ring. Recall that the sets are both -bases of . Definition. The Hall inner product is defined by setting and to be … Continue reading
Polynomials and Representations VIII
Matrix Balls Given a matrix A of non-negative integers, the standard RSK construction masks the symmetry between P and Q, but in fact we have: Symmetry Theorem. If A corresponds to (P, Q), then the transpose of A corresponds to (Q, P). In particular, if A is a … Continue reading
Posted in Uncategorized
Tagged combinatorics, matrix balls, partitions, rsk correspondence, young tableaux
Leave a comment
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
Posted in Uncategorized
Tagged combinatorics, partitions, rsk correspondence, symmetric polynomials, young tableaux
Leave a comment