In this paper, we study the basis of augmentation ideals and the quotient groups of finite non-abelian p-group which has a cyclic subgroup of index p, where p is an odd prime, and k is greater than or equal to 3. A co...In this paper, we study the basis of augmentation ideals and the quotient groups of finite non-abelian p-group which has a cyclic subgroup of index p, where p is an odd prime, and k is greater than or equal to 3. A concrete basis for the augmentation ideal is obtained and then the structure of its quotient groups can be determined.展开更多
For any prime p, all finite noncyclic p-groups which contain a self-centralizing cyclic normal subgroup are determined by using cohomological techniques. Some applications are given, including a character theoretic de...For any prime p, all finite noncyclic p-groups which contain a self-centralizing cyclic normal subgroup are determined by using cohomological techniques. Some applications are given, including a character theoretic description for such groups.展开更多
Let G be a finite group. A nonempty subset X of G is said to be noncommuting if xy≠yx for any x, y ∈ X with x≠y. If |X| ≥ |Y| for any other non-commuting set Y in G, then X is said to be a maximal non-commutin...Let G be a finite group. A nonempty subset X of G is said to be noncommuting if xy≠yx for any x, y ∈ X with x≠y. If |X| ≥ |Y| for any other non-commuting set Y in G, then X is said to be a maximal non-commuting set. In this paper, we determine upper and lower bounds on the cardinality of a maximal non-commuting set in a finite p-group with derived subgroup of prime order.展开更多
Assume that G is a finite non-abelian p-group.If G has an abelian maximal subgroup whose number of Generators is at least n,then G is called an M_(n)-group.For p=2,M_(2)-groups have been classified.For odd prime p,thi...Assume that G is a finite non-abelian p-group.If G has an abelian maximal subgroup whose number of Generators is at least n,then G is called an M_(n)-group.For p=2,M_(2)-groups have been classified.For odd prime p,this paper provides the isomorphism classification of M_(2)-groups,thereby achieving a complete classification of M_(2)-groups.展开更多
通过分析LDPC(Low Density Parity Check)码树图、PEG(Progressive Edge-Growth)算法和准循环LDPC码的特点,提出了一种将PEG算法和准循环矩阵相结合来构造LDPC码校验矩阵的新算法.在该算法中,首先利用PEG算法构造基矩阵,再用文中提出的...通过分析LDPC(Low Density Parity Check)码树图、PEG(Progressive Edge-Growth)算法和准循环LDPC码的特点,提出了一种将PEG算法和准循环矩阵相结合来构造LDPC码校验矩阵的新算法.在该算法中,首先利用PEG算法构造基矩阵,再用文中提出的移位参数公式和准循环LDPC码结构特点来构造循环置换矩阵;然后利用循环置换矩阵和全零矩阵对基矩阵进行扩展,从而得到围长至少为8的准循环LDPC码校验矩阵.该算法综合了PEG算法和准循环码的优点,纠错性能总体上好于PEG算法,在相同的码参数条件下的硬件实现比PEG算法简单,且参数选择具有较大灵活性.展开更多
In this paper by techniques of group we give some formulae for solving the general quadratic equations of two variables over a finite field,completely calculate and uniformly deal with the orders of automorphism group...In this paper by techniques of group we give some formulae for solving the general quadratic equations of two variables over a finite field,completely calculate and uniformly deal with the orders of automorphism groups of all p-groups of orders less than p6 under the P Hall's concept of isoclinism,also make a number of corrections for orders of automorphism groups offered for a mistake or fault before.展开更多
A ring R is called clean if every element is the sum of an idempotent and a unit, and R is called uniquely strongly clean (USC for short) if every element is uniquely the sum of an idempotent and a unit that commute...A ring R is called clean if every element is the sum of an idempotent and a unit, and R is called uniquely strongly clean (USC for short) if every element is uniquely the sum of an idempotent and a unit that commute. In this article, some conditions on a ring R and a group G such that RG is clean are given. It is also shown that if G is a locally finite group, then the group ring RG is USC if and only if R is USC, and G is a 2-group. The left uniquely exchange group ring, as a middle ring of the uniquely clean ring and the USC ring, does not possess this property, and so does the uniquely exchange group ring.展开更多
Using the metabelian property, regularity, p-commutativity and some properties of congruence, this paper gave the orders of automorphism groups of family Ф24, which are the groups of order p^6 determined by Rodney Ja...Using the metabelian property, regularity, p-commutativity and some properties of congruence, this paper gave the orders of automorphism groups of family Ф24, which are the groups of order p^6 determined by Rodney James, where p denotes an odd prime.展开更多
Theoretical background and an implementation of the p-group generation algorithm by Newman and O’Brien are used to provide computational evidence of a new type of periodically repeating patterns in pruned descendant ...Theoretical background and an implementation of the p-group generation algorithm by Newman and O’Brien are used to provide computational evidence of a new type of periodically repeating patterns in pruned descendant trees of finite p-groups.展开更多
文摘In this paper, we study the basis of augmentation ideals and the quotient groups of finite non-abelian p-group which has a cyclic subgroup of index p, where p is an odd prime, and k is greater than or equal to 3. A concrete basis for the augmentation ideal is obtained and then the structure of its quotient groups can be determined.
基金Supported by the NSF of China(11171194)by the NSF of Shanxi Province(2012011001-1)
文摘For any prime p, all finite noncyclic p-groups which contain a self-centralizing cyclic normal subgroup are determined by using cohomological techniques. Some applications are given, including a character theoretic description for such groups.
基金The NSF(11301150,11371124)of Chinathe NSF(142300410134)of Henan ProvincePlan for Scientific Innovation Talent(11CXRC19)of Henan University of Technology
文摘Let G be a finite group. A nonempty subset X of G is said to be noncommuting if xy≠yx for any x, y ∈ X with x≠y. If |X| ≥ |Y| for any other non-commuting set Y in G, then X is said to be a maximal non-commuting set. In this paper, we determine upper and lower bounds on the cardinality of a maximal non-commuting set in a finite p-group with derived subgroup of prime order.
文摘Assume that G is a finite non-abelian p-group.If G has an abelian maximal subgroup whose number of Generators is at least n,then G is called an M_(n)-group.For p=2,M_(2)-groups have been classified.For odd prime p,this paper provides the isomorphism classification of M_(2)-groups,thereby achieving a complete classification of M_(2)-groups.
文摘通过分析LDPC(Low Density Parity Check)码树图、PEG(Progressive Edge-Growth)算法和准循环LDPC码的特点,提出了一种将PEG算法和准循环矩阵相结合来构造LDPC码校验矩阵的新算法.在该算法中,首先利用PEG算法构造基矩阵,再用文中提出的移位参数公式和准循环LDPC码结构特点来构造循环置换矩阵;然后利用循环置换矩阵和全零矩阵对基矩阵进行扩展,从而得到围长至少为8的准循环LDPC码校验矩阵.该算法综合了PEG算法和准循环码的优点,纠错性能总体上好于PEG算法,在相同的码参数条件下的硬件实现比PEG算法简单,且参数选择具有较大灵活性.
基金Supported by the National Natural Science Foundation of China(61074185)Supported by the Projection of Science and Technique for Guangdong Province(2009B030802044)+1 种基金Supported by the Projection of Production,Study and Investigation for Guangdong Province(2010B090301042)Supported by the Science and Study Foundation of Guangxi University(XB2100285)
文摘In this paper by techniques of group we give some formulae for solving the general quadratic equations of two variables over a finite field,completely calculate and uniformly deal with the orders of automorphism groups of all p-groups of orders less than p6 under the P Hall's concept of isoclinism,also make a number of corrections for orders of automorphism groups offered for a mistake or fault before.
文摘A ring R is called clean if every element is the sum of an idempotent and a unit, and R is called uniquely strongly clean (USC for short) if every element is uniquely the sum of an idempotent and a unit that commute. In this article, some conditions on a ring R and a group G such that RG is clean are given. It is also shown that if G is a locally finite group, then the group ring RG is USC if and only if R is USC, and G is a 2-group. The left uniquely exchange group ring, as a middle ring of the uniquely clean ring and the USC ring, does not possess this property, and so does the uniquely exchange group ring.
基金The Science Research Foundation of Chongqing Municipal Education Commission of China(KJ050611)
文摘Using the metabelian property, regularity, p-commutativity and some properties of congruence, this paper gave the orders of automorphism groups of family Ф24, which are the groups of order p^6 determined by Rodney James, where p denotes an odd prime.
文摘Theoretical background and an implementation of the p-group generation algorithm by Newman and O’Brien are used to provide computational evidence of a new type of periodically repeating patterns in pruned descendant trees of finite p-groups.