论文标题
第3P度的原始排列组
Primitive permutation groups of degree 3p
论文作者
论文摘要
本文对原始排列$ 3p $的原始排列组进行了分析，其中$ p $是一个质量数字，类似于H. Wielandt对学位$ 2P $的处理。它也旨在作为系统使用组合方法的一个示例，该方法在\ s6中进行了调查，以使有关置换组的信息从知识中的知识中提炼信息。这项工作分为三个部分。第一部分包含计算的一半，确定排列特征的分解。第二部分包含对组合方法的调查，并基于这些方法是计算的主要部分。第三部分绑在纸上留下的松散末端，并给出了详细的数值结果的制表。
This paper presents an analysis of primitive permutation groups of degree $3p$, where $p$ is a prime number, analogous to H. Wielandt's treatment of groups of degree $2p$. It is also intended as an example of the systematic use of combinatorial methods as surveyed in \S6 for distilling information about a permutation group from knowledge of the decomposition of its character. The work is organised into three parts. Part I contains the lesser half of the calculation, the determination of the decomposition of the permutation character. Part II contains a survey of the combinatorial methods and, based on these methods, the major part of the calculation. Part III ties up loose ends left earlier in the paper and gives a tabulation of detailed numerical results.
