DIRECT PROOF OF THE DETERMINANT EXPRESSION FOR FLAGGED SKEW TABLEAUX  

作　　者：初文昌 

机构地区：[1]Institute of Systems Science, Academia Sinica, Beijing 100080, Chinalagged skew tableaux are generalizationa of Young tableaux in which each row (column)has an upper and lower bound on the entries. It has been shown that they are enumerated byflagged skew Schur functions. By introducing the dominance technique, we preeent an alternateproof for this conclusion directly.

出　　处：《Acta Mathematicae Applicatae Sinica》1992年第4期318-322,共5页应用数学学报（英文版）

摘　　要： Flagged skew tableaux are generalizationa of Young tableaux in which each row (column)has an upper and lower bound on the entries. It has been shown that they are enumerated byflagged skew Schur functions. By introducing the dominance technique, we preeent an alternateproof for this conclusion directly.Flagged skew tableaux are generalizationa of Young tableaux in which each row (column)has an upper and lower bound on the entries. It has been shown that they are enumerated byflagged skew Schur functions. By introducing the dominance technique, we preeent an alternateproof for this conclusion directly.

关 键 词：DIRECT PROOF OF THE DETERMINANT EXPRESSION FOR FLAGGED SKEW TABLEAUX 

分 类 号：O1[理学—数学]