From radin@math.biu.ac.il Mon Nov 13 09:14:35 2006 Date: Mon, 13 Nov 2006 09:14:30 +0200 (IST) From: Adin Ron To: Combinatorics Seminar: ; Subject: Bar-Ilan Combinatorics Seminar ============================== Bar-Ilan Combinatorics Seminar ============================== The next meeting of the seminar will take place, IYH, on (when) Tuesday, 23 Marcheshvan 5767 (Nov. 14) refreshments at 11:45 am, talk at 12 noon (where) Room 331 (Math Dept Seminar Room), Math and CS Building, Bar-Ilan University (who) Tamar Seeman (Bar-Ilan University) will talk about (what) "Shuffle invariance of the super-RSK algorithm" Abstract: --------- Let k and m be positive integers, and define the alphabet {1,2,...,k,1',2',...,m'}, where 1 < 2 < ... < k and 1' < 2' < ... < m'. Then {1,2,...,k} and {1',2',...,m'} can be shuffled together in "k+m choose k" different ways. The particular shuffle 1 < 2 < ... < k < 1' < 2' < ... < m' appears in two different super-RSK (Robinson-Schensted-Knuth) algorithms, which biject between sequences of variables from the alphabet, and pairs of super-SSYT (semistandard Young tableaux): the Berele-Regev super-RSK, and the Berele-Remmel super-RSK. >From each of these two algorithms, one can define a corresponding family of "k+m choose k" super-RSK's, with each algorithm in a family based on a different shuffle of {1,2,...,k} and {1',2',...,m'}. Because their underlying shuffles are different, two different algorithms chosen from the same family will produce two different pairs of tableaux, when applied to the same sequence. In the case of the Berele-Remmel super-RSK family, these different tableau pairs may have different shapes. However, we show that in the case of the Berele-Regev super-RSK family, all tableau pairs produced from the same sequence have the same shape, independently of the shuffle chosen. Forthcoming Events ================== * 30 Marcheshvan (Nov. 21) Adam Marcus (Georgia Tech): TBA ************************************************************************* You are all invited ! (Graduate students especially welcome) If you want to give a talk at the seminar, or know a prospective speaker, please contact Ron Adin . Seminar's homepage: *************************************************************************