s-Conditionally Permutable Subgroups and p-Nilpotency of Finite Groups

A subgroup H of G is called s-conditionally permutable in G if for every Sylow subgroup T of G,there exists an element x∈G such that HTx=TxH.In this paper,we investigate further the influence of s-conditionally permutability of some 2-maximal subgroups of the Sylow subgroup of G,on the structure of finite groups.New criteria for a group G being p-nilpotent are obtained.     

对n维Lotka-Volterra型捕食系统的分析

本文对一个n维Lotka-Volterra型捕食系统(1)用几何、代数及分析的方法给出了一般讨论,得到了系统(1)的一些性质和全局渐近稳定的一些充分条件。最后,作为例子,把这些结果用于n=4的情形,并作了适当的生态学解释。     

图的自同构群

讨论了置换群可图的充分必要条件并给出若干类可图的置换群。     

Weak Isomorphism of Finite Group

On the basis of the quasi-isomorphism of finite groups, a new mapping, weak isomorphism, from a finite group to another finite group is defined. Let G and H be two finite groups and G be weak-isomorphic to H. Then G≌H if G satisfies one of the following conditions. 1） G is a finite Abelian group. 2） The order of G is p^3. 3 ） The order of G is p^n＋1 and G has a cyclic normal subgroup N = 〈a〉 of order p^n. 4） G is a nilpotent group and if p^││G│, then for any P ∈ Sylp （G）, P has a cyclic maximal subgroup, where p is a prime; 5） G is a maximal class group of order p4（p〉3）.     

用置换群解决信息加密问题的探索

提出了用置换群来解决信息加密问题的观点 ;并对用置换群进行加密、解密算法进行了论证 ,对加密密钥和解密密钥作了一些说明 ;同时提出了用置换群解决信息加密问题时可能存在的一些问题 .     

用置换群解决信息加密问题的探索

提出了用置换群来解决信息加密问题的观点；并对用置换群进行加密、解密算法进行了论证，对加密密钥和解密密钥作了一些说明；同时提出了用置换群解决信息加密问题时可能存在的一些问题。