NORTHEASTERNUNIVERSITY
MATHEMATICSDEPARTMENT


Geometry-Algebra-Singularities-Combinatorics 
Seminar

 
Rc-graphs and Schensted insertion algorithm

 

Misha Kogan

(Northeastern University)



 
 
 
 
 
 

Northeastern University

509 Lake Hall

1:30 p.m., Monday, April 22, 2001

 
 
 

Abstract: We present a combinatorial rule for computing generalized Littlewood-Richardson coefficients cuwv in the cases when v is a shuffle, whose shape is a hook, or when v an r-shuffle and w is an r-semi-shuffle. The rule is given by generalizing Schensted insertion algorithm to rc-graph in the cases mentioned above. 
Home Web page: Alexandru I. Suciu Created: April 17, 2001
Maintained by:  Misha Kogan URL: http://www.math.neu.edu/~GASC/gas/kogan1.html