期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
置换群关于变换后基的强生成集的算法 被引量:1
1
作者 姜豪 《应用数学》 CSCD 北大核心 1994年第3期300-305,共6页
本文给出置换群关于变换后的基的强生成集的一种算法及其理论证明,并讨论了既约强生成集和最小强生成集的问题。
关键词 置换群 算法 变换 强生成集
在线阅读 下载PDF
On Inclusion of Permutation Modules
2
作者 Li Zhong WANG 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2013年第4期717-728,共12页
Let H1,H2 be subgroups of a finite group G. Assume that G = umlH2yiH1 = n Uj=1 HlgiH1 and that y1=1,g1= 1. Let Di be the set consisting of right cosets of H~ contained in H2yiH1 and let dj (j --- 1,..., n) be the s... Let H1,H2 be subgroups of a finite group G. Assume that G = umlH2yiH1 = n Uj=1 HlgiH1 and that y1=1,g1= 1. Let Di be the set consisting of right cosets of H~ contained in H2yiH1 and let dj (j --- 1,..., n) be the set consisting of right cosets contained in HlgjH1. We define the n x m matrix Mz (z = 1,..., m) whose columns and rows are indexed by Di and dj respectively and the (dk, Dz) entry is |Dzgk N Dl]. Let M =(M1 , Mm). Assume that 1GH1 and 1H2G are semisimple permutation modules of a finite group G. In this paper, by using the matrix M, we give some sufficient and necessary conditions such that 1~1 is isomorphic to a submodule of 1H2G. As an application, we prove Foulkes' conjecture in special cases. 展开更多
关键词 permutaion module Schur's lemma Foulkes' conjecture double cosets
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部