m × n × p真数组的字母表示
Letter Representations of m x n x p Proper Arrays
摘要:
令$m\neq n$。$m\times n\times p$ { \it proper array}是由服从某些约束的有向立方体组成的三维矩形阵列。由于这些约束,$m\times n\times p$适当阵列可经由其中每一$m\times n\times p$适当阵列与特定$m\times n$平面相关联的模式来分类。通过用不同的字母表示存在于$m\times n$平面中的每个连通分量,形成字母的$m\times n$阵列。此$m\times n$字母数组是与$m\times n\times p$正确数组关联的{ \it字母表示}。本文的主要结果涉及所有$m\times n$字母表示模对称的枚举,其中的对称性来自于组$D_2 = C_2\times C_2$作用于字母表示的集合。枚举是通过形成四个指数母函数的线性组合来实现的,每个指数母函数都是从特定的对称运算导出的。该线性组合计算在$D_2$下不等价的一组$m\times n$字母表示的分区数。这是通过形成四个生成函数来完成的,每个生成函数都来自特定的对称运算。
英文摘要:
Let $m\neq n$. An $m\times n\times p$ {\it proper array} is a three-dimensional rectangular array composed of directed cubes that obeys certain constraints. Because of these constraints, the $m\times n\times p$ proper arrays may be classified via a schema in which each $m\times n\times p$ proper array is associated with a particular $m\times n$ planar face. By representing each connected component present in the $m\times n$ planar face with a distinct letter, an $m\times n$ array of letters is formed. This $m\times n$ array of letters is the {\it letter representation} associated with the $m\times n\times p$ proper array. The main result of this paper involves the enumeration of all $m\times n$ letter representations modulo symmetry, where the symmetry is derived from the group $D_2 = C_2\times C_2$ acting on the set of letter representations. The enumeration is achieved by forming a linear combination of four exponential generating functions, each of which is derived from a particular symmetry operation. This linear combination counts the number of partitions of the set of $m\times n$ letter representations that are inequivalent under $D_2$. This is done by forming four generating functions, each of which derives from a particular symmetry operation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。