首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
Among other things, we prove that a polycyclic group admitting an automorphism of order two with finitely many fixed elements is abelian-by-finite. An example shows that this result cannot be extended to finitely generated soluble groups.  相似文献   

3.
For a wide class of Abelian groups, necessary and sufficient conditions under which a group admits an automorphism of order qn are found; we also present necessary and sufficient conditions under which a group admits an automorphism ϕ of order qn such that ϕqm is a fixed-point-free automorphism for some m < n. Translated from Matematicheskie Zametki, Vol. 21, No. 2, pp. 239–249, February, 1977.  相似文献   

4.
5.
All Mendelsohn designs containing a Frobenius group with cyclic complement of orderv – 1 as a subgroup of the automorphism are found. Furthermore, the automorphism group of each of the designs is constructed. These designs generalize Mendelsohn's construction of Mendelsohn designs containing a certain doubly transitive automorphism group.The research on this paper was partially supported by North Texas State Faculty Research Grant #35524.  相似文献   

6.
7.
Suppose that a Lie algebra L admits a finite Frobenius group of automorphisms FH with cyclic kernel F and complement H such that the characteristic of the ground field does not divide |H|. It is proved that if the subalgebra C L (F) of fixed points of the kernel has finite dimension m and the subalgebra C L (H) of fixed points of the complement is nilpotent of class c, then L has a nilpotent subalgebra of finite codimension bounded in terms of m, c, |H|, and |F| whose nilpotency class is bounded in terms of only |H| and c. Examples show that the condition of F being cyclic is essential.  相似文献   

8.
9.
We study a class of t-designs which enjoy a high degree of regularity. These are the subsets of vertices of the Johnson graph which are completely regular, in the sense of Delsarte [Philips Res. Reports Suppl. 10 (1973)]. After setting up the basic theory, we describe the known completely regular designs. We derive very strong restrictions which must hold in order for a design to be completely regular. As a result, we are able to determine which symmetric designs are completely regular and which Steiner systems with t = 2 are completely regular. © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 261–273, 1998  相似文献   

10.
11.
The possible existence of 16 parameter sets for strongly regular graphs with 100 or less vertices is still unknown. In this paper, we outline a method to search for strongly regular graphs by assuming a non-trivial automorphism of prime order. Among these unknown parameter sets, we eliminated many possible automorphisms, but some small prime orders still remain. We also found 6 new strongly regular graphs with parameters (49,18,7,6).  相似文献   

12.
13.
Mathematische Zeitschrift -  相似文献   

14.
A solvable cover of a graph is a regular cover whose covering transformation group is solvable. In this paper, we show that a solvable cover of a graph can be decomposed into layers of abelian covers, and also, a lift of a given automorphism of the base graph of a solvable cover can be decomposed into layers of lifts of the automorphism in the layers of the abelian covers. This procedure is applied to classify metacyclic covers of the tetrahedron branched at face-centers.  相似文献   

15.
Novosibirsk. Translated fromSibirskiî Matematicheskiî Zhurnal, Vol. 33, No. 5, pp. 206–208, September–October, 1992.  相似文献   

16.
17.
18.
Dedicated to the memory of A. I. Mal'tsev.  相似文献   

19.
Let G be a polycyclic group and α a regular automorphism of order four of G. If the map φ: G→ G defined by g~φ= [g, α] is surjective, then the second derived group of G is contained in the centre of G. Abandoning the condition on surjectivity, we prove that C_G(α~2) and G/[G, α~2] are both abelian-by-finite.  相似文献   

20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号