COMBINATORIAL PROOFS OF HOOK GENERATING-FUNCTIONS FOR SKEW PLANE PARTITIONS

被引：3
|
作者：
SAGAN, BE
机构：
[1] Department of Mathematics, Michigan State University, East Lansing
来源：
THEORETICAL COMPUTER SCIENCE | 1993年 / 117卷 / 1-2期
基金：
美国国家科学基金会;
关键词：
D O I：
10.1016/0304-3975(93)90319-O
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We provide combinatorial proofs of two hook generating functions for skew plane partitions. One proof involves the Hillman-Grassl (1976) algorithm and the other uses a modification of Schutzenberger's (1963,1977) ''jeu de taquin'' due to Kadell (to appear). We also provide a bijection showing directly that these two generating functions are equal. Analogous results for skew shifted plane partitions are proved. Finally, some open questions are discussed.
引用
收藏
页码：273 / 287
页数：15
相关论文
共 50 条
12345