关于分拆的Schaper数
On the Schaper Number of Partitions
摘要:
Schaper求和公式是计算对称群的分解数的最有用的工具之一。对于给定的Specht模,这个公式的效用可以通过知道相应划分的Schaper数来提高。Fayers给出了那些Schaper数至少为2的分区的特征。在本文中,我们将演示如何使用这些知识来计算一些分解数,然后再扩展这个结果,希望在将来可以计算更多的分解数。对于$p=2$,我们将给出Schaper数至少为3的分区和Schaper数至少为4的分区的完整刻画。给出了奇素数的Schaper数至少为3的划分的必要条件,并对这些条件的充分性提出了一个猜想。
英文摘要:
One of the most useful tools for calculating the decomposition numbers of the symmetric group is Schaper's sum formula. The utility of this formula for a given Specht module can be improved by knowing the Schaper Number of the corresponding partition. Fayers gives a characterisation of those partitions whose Schaper number is at least two. In this paper we shall demonstrate how this knowledge can be used to calculate some decomposition numbers before extending this result with the hope of allowing more decomposition numbers to be calculated in the future. For $p=2$ we shall give a complete characterisation of partitions whose Schaper number is at least three, and those whose Schaper number at least four. We also present a list of necessary conditions for a partition to have Schaper number at least three for odd primes and a conjecture on the sufficiency of these conditions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。