A finite p-group G is called an LA-group if |G|||Aut(G)| when G is non-cyclic and |G|>p^2. This paper shows that a p-group of order p^n with an element of order p^(n-2) is an LA-group.
In the paper we obtain two infinite classes of p-groups, calculate the orders of their automorphism groups and correct a mistake（perhaps misprinted） of Rodney James＇ paper in 1980.
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.展开更多
Some new techniques are given to prove that two sorts of Abelian groups cannot function as the full automorphism groups of the finite groups. With generality these techniques made a breakthrough in MacHale’s problem.
Based on a general theory of descendant trees of finite p-groups and the virtual periodicity isomorphisms between the branches of a coclass subtree, the behavior of algebraic invariants of the tree vertices and their ...Based on a general theory of descendant trees of finite p-groups and the virtual periodicity isomorphisms between the branches of a coclass subtree, the behavior of algebraic invariants of the tree vertices and their automorphism groups under these isomorphisms is described with simple transformation laws. For the tree of finite 3-groups with elementary bicyclic commutator qu-otient, the information content of each coclass subtree with metabelian main-line is shown to be finite. As a striking novelty in this paper, evidence is provided of co-periodicity isomorphisms between coclass forests which reduce the information content of the entire metabelian skeleton and a significant part of non-metabelian vertices to a finite amount of data.展开更多
文摘A finite p-group G is called an LA-group if |G|||Aut(G)| when G is non-cyclic and |G|>p^2. This paper shows that a p-group of order p^n with an element of order p^(n-2) is an LA-group.
基金Supported by NNSF of China(60574052)Supported by NSF(05001820)Supported by PST of Guangdong(2005B33301008)
文摘In the paper we obtain two infinite classes of p-groups, calculate the orders of their automorphism groups and correct a mistake（perhaps misprinted） of Rodney James＇ paper in 1980.
基金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.
基金Project supported by the National Natural Science Foundation of China.
文摘Some new techniques are given to prove that two sorts of Abelian groups cannot function as the full automorphism groups of the finite groups. With generality these techniques made a breakthrough in MacHale’s problem.
文摘Based on a general theory of descendant trees of finite p-groups and the virtual periodicity isomorphisms between the branches of a coclass subtree, the behavior of algebraic invariants of the tree vertices and their automorphism groups under these isomorphisms is described with simple transformation laws. For the tree of finite 3-groups with elementary bicyclic commutator qu-otient, the information content of each coclass subtree with metabelian main-line is shown to be finite. As a striking novelty in this paper, evidence is provided of co-periodicity isomorphisms between coclass forests which reduce the information content of the entire metabelian skeleton and a significant part of non-metabelian vertices to a finite amount of data.
