The Robinson-Schensted and Sch¨ utzenberger algorithms, an elementary approach Marc A. A. van Leeuwen CWI Postbus 94079

First Page		Document Content
Date: 2014-09-01 05:21:14 Algebraic combinatorics Symmetric functions Representation theory of finite groups Permutations Representation theory Robinson–Schensted–Knuth correspondence Robinson–Schensted correspondence Young tableau Littlewood–Richardson rule Abstract algebra Algebra Mathematics		The Robinson-Schensted and Sch¨ utzenberger algorithms, an elementary approach Marc A. A. van Leeuwen CWI Postbus 94079 Add to Reading List Source URL: www-math.univ-poitiers.fr Download Document from Source Website File Size: 527,71 KB Share Document on Facebook

	The Robinson-Schensted and Sch¨ utzenberger algorithms, an elementary approach Marc A. A. van Leeuwen CWI Postbus 94079 DocID: 11Aiv - View Document
	Spin-preserving Knuth correspondences for ribbon tableaux Marc A. A. van Leeuwen Universit´e de Poitiers, D´epartement de Math´ematiques, UFR Sciences SP2MI, T´el´eport 2, BP 30179, 86962 Futuroscope Chasseneuil Ced DocID: 11yoQ - View Document
	Double crystals of binary and integral matrices Marc A. A. van Leeuwen Universit´e de Poitiers, D´epartement de Math´ematiques, BP 30179, 86962 Futuroscope Chasseneuil Cedex, France -poitiers DocID: 11wzq - View Document
	Alternating sign matrices Ronald C King September 30, 2005 School of Mathematics, University of Southampton, Southampton SO17 1BJ, England DocID: 10EUp - View Document
	Parking functions to non-decreasing parking function DocID: etIP - View Document