首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 13 毫秒
1.
2.
We find an elementary equivalence criterion for the lattices of subalgebras of free algebras in regular varieties. The question is addressed of elementary equivalence for the automorphism groups of algebras of this type.  相似文献   

3.
On automorphism groups of some finite groups   总被引:1,自引:0,他引:1  
We show that if n > 1 is odd and has no divisor p4 for any prime p, then there is no finite group G such that│Aut(G)│ = n.  相似文献   

4.
Summary It is shown that the outer automorphism group of a Coxeter groupW of finite rank is finite if the Coxeter graph contains no infinite bonds. A key step in the proof is to show that if the group is irreducible andΠ 1 andΠ 2 any two bases of the root system ofW, thenΠ 2 = ±ωΠ 1 for some ω εW. The proof of this latter fact employs some properties of the dominance order on the root system introduced by Brink and Howlett. This article was processed by the author using the Springer-Verlag TEX PJour1g macro package 1991.  相似文献   

5.
For the free rank 2 metabelian Lie algebra over an infinite field we prove that an endomorphism of the algebra which preserves the automorphic orbit of a nonzero element is an automorphism. We construct some counterexamples over finite fields.  相似文献   

6.
7.
It is proved that all automorphism groups of the sporadic simple groups are characterized by their element orders and the group orders.  相似文献   

8.
In this article we study the product action of the direct product of automorphism groups of graphs. We generalize the results of Watkins [J. Combin Theory 11 (1971), 95–104], Nowitz and Watkins [Monatsh. Math. 76 (1972), 168–171] and W. Imrich [Israel J. Math. 11 (1972), 258–264], and we show that except for an infinite family of groups Sn × Sn, n≥2 and three other groups D4 × S2, D4 × D4 and S4 × S2 × S2, the direct product of automorphism groups of two graphs is itself the automorphism group of a graph. © 2009 Wiley Periodicals, Inc. J Graph Theory 62: 26–36, 2009  相似文献   

9.

Let be a free group of finite rank , let be the semigroup of endomorphisms of , and let be the group of automorphisms of .



Theorem. If is an automorphism of , then there is an such that for all .

  相似文献   


10.
It is shown that for any finite group Γ, there exists a 2k‐cycle system whose full automorphism group is isomorphic to Γ. Furthermore, the minimal order of such a system is at most , where .  相似文献   

11.
We determine all isomorphisms between the endomorphism semigroups of free monoids or free semigroups and prove that automorphisms of the endomorphism semigroup of a free monoid or a free semigroup are inner or ``mirror inner". In particular, we answer a question of B. I. Plotkin.

  相似文献   


12.
In this paper, a finite group G with IAut(G) : P(G)I ~- p or pq is determined, where P(G) is the power automorphism group of G, and p, q are distinct primes. Especially, we prove that a finite group G satisfies |Aut(G) : P(G)|= pq if and only if Aut(G)/P(G) ≌S3. Also, some other classes of finite groups are investigated and classified, which are necessary for the proof of our main results.  相似文献   

13.
14.
Solvable line-transitive automorphism groups of finite linear spaces   总被引:3,自引:0,他引:3  
Let S be a finite linear space, and letG be a group of automorphisms of S. IfG is soluble and line-transitive, then for a givenk but a finite number of pairs of (S, G),S hasv= p n points andGAΓL(1,p n ).  相似文献   

15.
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.  相似文献   

16.
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. Project supported by the National Natural Science Foundation of China.  相似文献   

17.
Let be an almost crystallographic (AC-) group, corresponding to the simply connected, connected, nilpotent Lie group and with holonomy group . If , there is a faithful representation . In case is crystallographic, this condition is known to be equivalent to or . We will show (Example 2.2) that, for AC-groups , this is no longer valid and should be adapted. A generalised equivalent algebraic (and easier to verify) condition is presented (Theorem 2.3). Corresponding to an AC-group and by factoring out subsequent centers we construct a series of AC-groups, which becomes constant after a finite number of terms. Under suitable conditions, this opens a way to represent faithfully in (Theorem 4.1). We show how this can be used to calculate . This is of importance, especially, when is almost Bieberbach and, hence, is known to have an interesting geometric meaning.

  相似文献   


18.
We examine the palindromic automorphism group , of a free group F n , a group first defined by Collins in [5] which is related to hyperelliptic involutions of mapping class groups, congruence subgroups of , and symmetric automorphism groups of free groups. Cohomological properties of the group are explored by looking at a contractible space on which acts properly with finite quotient. Our results answer some conjectures of Collins and provide a few striking results about the cohomology of , such as that its rational cohomology is zero at the vcd. Received: January 17, 2000.  相似文献   

19.
Let G be a group with a set of operators such that Z(G) is -admissible. Central -automorphisms occur in the Krull-Remak-Schmidt Theorem. We discuss the existence of a central -endomorphism of G that is not an automorphism.2000 Mathematics Subject Classification: 20E36  相似文献   

20.
It was shown by Babai and Imrich [2] that every finite group of odd order except and admits a regular representation as the automorphism group of a tournament. Here, we show that for k ≥ 3, every finite group whose order is relatively prime to and strictly larger than k admits a regular representation as the automorphism group of a k‐tournament. Our constructions are elementary, suggesting that the problem is significantly simpler for k‐tournaments than for binary tournaments. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 238–248, 2002  相似文献   

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

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