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 HTK = T^KH. 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.

Topological Dynamics in Tandem with Permutation Groups

The purpose of this study was to delve into the aspects of abstract algebra that has a link with topological dynamics in terms of permutation and symmetric groups. This would aid users to appreciate the role it plays in the theory and application of topological dynamics. The usage of matlab programming to carry out the permutations was carried out. The study contributes to the literature by providing candid explanation and usage of data-based evidence documenting the extent to which topological dynamics operates.

QUASI-PERMUTATION REPRESENTATIONS OF ALTERNATING AND SYMMETRIC GROUPS

The quantities c（G）, q（G） and p（G） for finite groups were defined by H. Behravesh. In this article, these quantities for the alternating group An and the symmetric group Sn are calculated. It is shown that c（G） = q（G） = p（G） = n,when G = An or Sn.

REVERSIBLE LOGIC GATE NETWORK CASCADE BASED ON PERMUTATION GROUP

The cascade of reversible logic gate network with n inputs and n outputs forms a group isomorphic to the symmetric group S2^n. Characteristics of a number of gates from the set of all generalized Toffoli gates are studied. Any permutation Sn is proved to be generated by a n-cycle 9 and a permutation τ= （ij,ik） together. It shows that any neighboring 2-cycle permutation can be generated by at most two NOT gates without ancilla bit. Based on the above theory, a cascade algorithm for reversible logic gate networks is proposed. A reversible example of logic gate network cascade is given to show the correctness of the algorithm.

The influence of s-conditionally permutable subgroups on finite groups

A subgroup H of a group 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. Using the concept of s-conditionally permutable subgroups, some new characterizations of finite groups are obtained and several interesting results are generalized.

On the Representations of Γ1-Nonderanged Permutation Group gp

Representation theory is concerned with the ways of explaining or visualizing a group as a group of matrices. In this paper, we extend the permutation pattern of to a two-line notation. We consider the representations of this non-deranged permutation group(p ≥ 5 and p a prime). Also we reveal some interesting properties and results of the character of where .

A Minimal Presentation of a Two-Generator Permutation Group on the Set of Integers

In this paper, we investigate the algebraic structure of certain 2-generator groups of permutations of the integers. The groups fall into two infinite classes: one class terminates with the quaternion group and the other class terminates with the Klein-four group. We show that all the groups are finitely presented and we determine minimal presentations in each case. Finally, we determine the order of each group.

On Generalized PST-groups

A finite group G is called a generalized PST-group if every subgroup contained in F（G） permutes all Sylow subgroups of G, where F（G） is the Fitting subgroup of G. The class of generalized PST-groups is not subgroup and quotient group closed, and it properly contains the class of PST-groups. In this paper, the structure of generalized PST-groups is first investigated. Then, with its help, groups whose every subgroup （or every quotient group） is a generalized PST-group are deter- mined, and it is shown that such groups are precisely PST-groups. As applications, T-groups and PT-groups are characterized.

基于群组置换密码的无线保密通信网络安全分簇路由算法

鉴于目前无线通信网络分簇路由算法对网络的保密性较低,提出了基于群组置换密码的无线保密通信网络安全分簇路由算法。首先,采用改进置换密钥矩阵加密算法(RKM)对无线通信网络的信息使用多米诺查表加字节变换,并在其中穿插特征变换因子进行多次变换完成无线通信网络加密;使用反向的多米诺查表和自己变换配合特征变换因子进行解密。然后,以加密后无线保密通信网络为基础,计算网络最佳簇头。采用引力算法通过以簇头为质点计算其对不同节点的引力完成分簇,并以低能耗作为遗传算法的适应度函数进行网络簇头选举,结合代价函数优化簇间跳转策略,挑选能量足、位置好的节点,作为优质的通信路由,实现网络安全、低能耗传输。实验结果表明:该算法的混乱性高、扩散性强可以保证无线通信数据不被他人破解;该算法可以选择出节点存活数量最高的簇头,且网络节点的剩余能量最高。

The Influence of s-Conditional Permutability of Subgroups on the Structure of Finite Groups

Let G be a finite group. Fix a prime divisor p of IGI and a Sylow p-subgroup P of G, let d be the smallest generator number of P and Ma（P） denote a family of maximal subgroups P1, P2 , Pd of P satisfying ∩^di=1 Pi = Ф（P）, the Frattini subgroup of P. In this paper, we shall investigate the influence of s-conditional permutability of the members of some fixed .Md（P） on the structure of finite groups. Some new results are obtained and some known results are generalized.

二面体群D_(3)的同构——从一个误解说起

从二面体群D_(3)的非交换性的一个错误解法出发,研究D_(3)的矩阵表示,证明了D_(3)、具体的矩阵乘法群和三次对称群的同构,由此验证了D_(3)的生成元和生成关系.

Self-Dual Permutation Codes over Finite Chain Rings

Permutation codes over finite chain rings are introduced; by using the character of the finite chain rings and the knowledge of representation of group, some conditions for existence or non-existence of self-dual permutation codes over finite chain rings are obtained. Specially, when the group is a direct product of a 2-group and a T-group, and the group action is transitive, the sufficient and necessary condition of the existence of permutation codes is given.

SELF-DUAL PERMUTATION CODES OVER FORMAL POWER SERIES RINGS AND FINITE PRINCIPAL IDEAL RINGS

In this paper, we study self-dual permutation codes over formal power series rings and finite principal ideal rings. We first give some results on the torsion codes associated with the linear codes over formal power series rings. These results allow for obtaining some conditions for non-existence of self-dual permutation codes over formal power series rings. Finally, we describe self-dual permutation codes over finite principal ideal rings by examining permutation codes over their component chain rings.

X-s-Permutable Subgroups

Let X be a nonempty subset of a group G. A subgroup H of G is said to be X-spermutable in G if, for every Sylow subgroup T of G, there exists an element x E X such that HT^x= T^xH. In this paper, we obtain some results about the X-s-permutable subgroups and use them to determine the structure of some finite groups.

ON SELF-DUAL PERMUTATION CODES

Permutation codes over finite fields are introduced, some conditions for existence or non-existence of self-dual permutation codes are obtained.

Influence of Certain Permutable Subgroups on Finite Smooth Groups

A subgroup H of a finite group G is said to be permutable in G if it permutes with every subgroup of G. In this paper, we determine the finite groups which have a permutable subgroup of prime order and whose maximal subgroups are totally （generalized） smooth groups.

Solving the Class Equation x^d= β in an Alternating Group for Each β ∈ C^α∩ H_n^cand n >1

The main purpose of this paper is to solve the class equation in an alternating group, (i.e. find the solutions set ) and find the number of these solutions where ranges over the conjugacy class in and d is a positive integer. In this paper we solve the class equation in where , for all . is the complement set of where { of , with all parts of are different and odd}. is conjugacy class of and form class depends on the cycle type of its elements If and , then splits into the two classes of .

Double Derangement Permutations

Let n be a positive integer. A permutation a of the symmetric group of permutations of is called a derangement if for each . Suppose that x and y are two arbitrary permutations of . We say that a permutation a is a double derangement with respect to x and y if and for each . In this paper, we give an explicit formula for , the number of double derangements with respect to x and y. Let and let and be two subsets of with and . Suppose that denotes the number of derangements x such that . As the main result, we show that if and z is a permutation such that for and for , then where .

On the Group of ρ-endotrivial κG-modules

In this paper, we define a group T_ρ(G) of p-endotrivial κG-modules and a generalized Dade group D_ρ(G) for a finite group G. We prove that T_ρ(G)≌T_ρ(H)whenever the subgroup H contains a normalizer of a Sylow p-subgroup of G, in this case, K(G)≌K(H). We also prove that the group D_ρ(G) can be embedded into T_ρ(G) as a subgroup.

On X-s-Permutable Subgroups of a Finite Group

Let X be a nonempty subset of a group G. A subgroup H of G is said to be X- s-permutable in G if there exists an element x E X such that HP^x = P^xH for every Sylow subgroup P of G. In this paper, some new results are given under the assumption that some suited subgroups of G are X-s-permutable in G.