Plane Partitions: Past, Present, and Future a
Plane Partitions: Past, Present, and Future a
复制标题
平面分割：过去、现在和未来
DOI：
10.1111/j.1749-6632.1989.tb22478.x
复制
发表时间：
1989
影响因子：
5.2
通讯作者：
R. Stanley
中科院分区：
文献类型：
--
作者：
R. Stanley
我们在这里的目的不是对平面划分理论进行全面的概述。截至1971年的这一调查见[Zl]，而最近的工作摘要见[22]和[23]。相反，我们将概述一些基本的定义、结果和猜想，这些应该为有兴趣进一步研究该主题的读者提供一个进入更详细工作的入口。平面划分是非负整数nij的阵列a=(Nij)i，j2，它在行和列上弱递减，并且对于它在i：=1Ajj<；00中。当写入平面分区时，零条目通常被抑制。因此，例如，
It is not our purpose here to give a comprehensive survey of the theory of plane partitions. Such a survey up to 1971 was given in [Zl], while summaries of more recent work appear in [22] and [23]. We will instead sketch some basic definitions, results, and conjectures that should provide an entry into more detailed work for readers interested in pursuing the subject further. A plane partition is an array a = (nij)i, j 2 , of nonnegative integers nij that is weakly decreasing in rows and columns, and for which In I: = 1 ajj < 00. When writing a plane partition the zero entries are usually suppressed. Thus, for instance,