设H是有限群G的一个子群,H在G中是弱Φ-可补的,如果存在G的一个子群K,使得G=HK且H∩K≤Φ(H),其中Φ(H)是H的Frattini子群.利用p阶和p^2阶子群的弱Φ-可补性,得到如下结论:1)设G是有限群,p是|G|的满足(|G|,p-1)=1的素因数.设E是G的一个...设H是有限群G的一个子群,H在G中是弱Φ-可补的,如果存在G的一个子群K,使得G=HK且H∩K≤Φ(H),其中Φ(H)是H的Frattini子群.利用p阶和p^2阶子群的弱Φ-可补性,得到如下结论:1)设G是有限群,p是|G|的满足(|G|,p-1)=1的素因数.设E是G的一个正规子群使得G/E是p-幂零群.若E p∩G N p的每个阶为p或4循环子群均在G中弱Φ-可补,那么G是p-幂零群.2)设G有限群,p是|G|满足(|G|,p^2-1)=1的素因数.设E是G的正规子群使得G/E是p-幂零的.若E p∩G N p的每个阶为p^2的子群均在G中弱Φ-可补,则G是p-幂零的.由这些结论,得到了一系列推论,推广了已知结果.展开更多
A large class of NP optimization problems called MNP are studied. It is shown that Rmax(2) is in this class and some problems which are not likely in Rmax(2) are in this class. A new kind of reductions, SL-reductions,...A large class of NP optimization problems called MNP are studied. It is shown that Rmax(2) is in this class and some problems which are not likely in Rmax(2) are in this class. A new kind of reductions, SL-reductions, is defined to preserve approximability and nonapprokimability, so it is a more general version of L-reductions and A-reductions. Then some complete problems of this class under SL-reductions are shown and it is proved that the max-clique problem is one of them. So all complete problems in this class are as difficult to approximate as the max-clique problem.展开更多
文摘设H是有限群G的一个子群,H在G中是弱Φ-可补的,如果存在G的一个子群K,使得G=HK且H∩K≤Φ(H),其中Φ(H)是H的Frattini子群.利用p阶和p^2阶子群的弱Φ-可补性,得到如下结论:1)设G是有限群,p是|G|的满足(|G|,p-1)=1的素因数.设E是G的一个正规子群使得G/E是p-幂零群.若E p∩G N p的每个阶为p或4循环子群均在G中弱Φ-可补,那么G是p-幂零群.2)设G有限群,p是|G|满足(|G|,p^2-1)=1的素因数.设E是G的正规子群使得G/E是p-幂零的.若E p∩G N p的每个阶为p^2的子群均在G中弱Φ-可补,则G是p-幂零的.由这些结论,得到了一系列推论,推广了已知结果.
基金The National Natural Science Foundation of China grant !No.69373006 The National Hi-Tech Programme of China grant !No. 863-3
文摘A large class of NP optimization problems called MNP are studied. It is shown that Rmax(2) is in this class and some problems which are not likely in Rmax(2) are in this class. A new kind of reductions, SL-reductions, is defined to preserve approximability and nonapprokimability, so it is a more general version of L-reductions and A-reductions. Then some complete problems of this class under SL-reductions are shown and it is proved that the max-clique problem is one of them. So all complete problems in this class are as difficult to approximate as the max-clique problem.
