Recognizing the Automorphism Groups of Mathieu Groups

It is a well-known fact that characters of a finite group can give important information about the structure of the group. It was also proved by the third author that a finite simple group can be uniquely determined by its character table. Here the authors attempt to investigate how to characterize a finite almost-simple group by using less information of its character table, and successfully characterize the automorphism groups of Mathieu groups by their orders and at most two irreducible character degrees of their character tables.     

Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups

It is known that a number of algebraic properties of the braidgroups extend to arbitrary finite Coxeter-type Artin groups.Here we show how to extend the results to more general groupsthat we call Garside groups. Define a Gaussian monoid to be a finitely generated cancellativemonoid where the expressions of a given element have boundedlengths, and where left and right lowest common multiples exist.A Garside monoid is a Gaussian monoid in which the left andright lowest common multiples satisfy an additional symmetrycondition. A Gaussian group is the group of fractions of a Gaussianmonoid, and a Garside group is the group of fractions of a Garsidemonoid. Braid groups and, more generally, finite Coxeter-typeArtin groups are Garside groups. We determine algorithmic criteriain terms of presentations for recognizing Gaussian and Garsidemonoids and groups, and exhibit infinite families of such groups.We describe simple algorithms that solve the word problem ina Gaussian group, show that these algorithms have a quadraticcomplexity if the group is a Garside group, and prove that Garsidegroups have quadratic isoperimetric inequalities. We constructnormal forms for Gaussian groups, and prove that, in the caseof a Garside group, the language of normal forms is regular,symmetric, and geodesic, has the 5-fellow traveller property,and has the uniqueness property. This shows in particular thatGarside groups are geodesically fully biautomatic. Finally,we consider an automorphism of a finite Coxeter-type Artin groupderived from an automorphism of its defining Coxeter graph,and prove that the subgroup of elements fixed by this automorphismis also a finite Coxeter-type Artin group that can be explicitlydetermined. 1991 Mathematics Subject Classification: primary20F05, 20F36; secondary 20B40, 20M05.     

一类不能作为自同构群的奇阶群

本文考虑如下问题：怎样的有限群可以作为另一个有限群的全自同构群？我们首先证明，若有限群Ｋ有一个正规Ｓｙｌｏｗｐ－子群使得｜Ｋ：Ｚ（Ｋ）｜ｐ＝ｐ２，那么Ｋ有２阶自同构．利用这个结果，我们证明了，若奇阶群Ｇ具有阶Ｐｓｍ（１≤ｓ≤３），ｐ为｜Ｇ｜的最小素因子，ｐｍ，ｍ无立方因子，则Ｇ不可能作为全自同构群．     

Negative K-Theory of Generalized Quaternion Groups and Binary Polyhedral Groups

Classical group representation theory is used to determine which finite groups have finite negative K-theory. There follows a computation of the K _?1 of integral group rings ZG for all finite non-abelian subgroups of the group SU(2) of unit quaternions. In principle, the method applies to any finite group.     

关于几乎可解群

本文推广了关于局部有限群的Asar定理及p.Hall—Kulatilaka,Kargapolov定理.     

Coleman Automorphisms of Extensions of Finite Characteristically Simple Groups by Some Finite Groups

Let G be an extension of a finite characteristically simple group by an abelian group or a finite simple group.It is shown that every Coleman automorphism of G is an inner automorphism.Interest in such automorphisms arises from the study of the normalizer problem for integral group rings.     

Composition Factors of the Finite Groups Isospectral to Simple Classical Groups

Siberian Mathematical Journal - Isospectral are the groups with coinciding sets of element orders. We prove that no finite group isospectral to a finite simple classical group has the...     

Double Coset Decompositions of Groups

We show that residually finite or word hyperbolic groups which can be decomposed as a finite union of double cosets of a cyclic subgroup are necessarily virtually cyclic, and we apply this result to the study of Frobenius permutation groups. We show that in general, finite double coset decompositions of a group can be interpreted as an obstruction to splitting a group as a free product with amalgamation or an HNN extension.     

Recognizing the Automorphism Groups of Mathieu Groups Through Their Orders and Large Degrees of Their Irreducible Characters

It is a well-known fact that characters of a finite group can give important information about the structure of the group. It was also proved by the third author that a finite simple group can be uniquely determined by its character table. Here the authors attempt to investigate how to characterize a finite almost-simple group by using less information of its character table, and successfully characterize the automorphism groups of Mathieu groups by their orders and at most two irreducible character degrees of their character tables.     

Cycle-Closed Permutation Groups

A finite permutation group is cycle-closed if it contains all the cycles of all of its elements. It is shown by elementary means that the cycle-closed groups are precisely the direct products of symmetric groups and cyclic groups of prime order. Moreover, from any group, a cycle-closed group is reached in at most three steps, a step consisting of adding all cycles of all group elements. For infinite groups, there are several possible generalisations. Some analogues of the finite result are proved.     

Smooth Groups

A group is called smooth if it has a finite maximal chain of subgroups in which any two intervals of the same length are isomorphic (as lattices). We show that every finite smooth group G is a semidirect product of a p-group by a cyclic group; in particular, G is soluble. We determine the exact structure of G if G is not a p-group.     

Idempotent-Conjugate Monoids with Nilpotent Unit Groups

Let M be a finite monoid with unit group G such that J-related idempotents in M are conjugate. If G is nilpotent, we prove that the complex monoid algebra CM of M is semisimple if and only if M is an inverse monoid. Conversely let G be a finite group such that for any finite idempotent-conjugate monoid M with unit group G, CM semisimple implies that M is an inverse monoid. We then show that G is a nilpotent group.     

Periodic Endomorphisms of Polycyclic Groups

Let G be a polycyclic group. As a consequence of known results, any periodic group of automorphisms of G is finite and there is an upper bound (depending only on G) for its order. On the other hand, a periodic semigroup of endomorphisms of G need not be finite but we prove that it is locally finite. Also we show that the order of periodic endomorphisms of G is bounded.     

On a Family of Residually Finite Groups

Mathematical Notes - It is known that there exists a finitely generated residually finite group (for short, a residually F-group) the extension by which of some finite group is not a residually...     

若干单群与射影平面直射群

设G是有限群,H(?)G。如果H≌~2B_2(q)或H≌~2G_2(q)或H≌PSU(3,q),则G不与任何射影平面的点传递直射群同均。本文对以下问题给出了一般方法:证明以某些几乎单群为点传递自同构群的线性空间不是射影平面。     

Hopficity and Co-Hopficity in Soluble Groups

We show that a soluble group satisfying the minimal condition for its normal subgroups is co-hopfian and that a torsion-free finitely generated soluble group of finite rank is hopfian. The latter property is a consequence of a stronger result: in a minimax soluble group, the kernel of an endomorphism is finite if and only if its image is of finite index in the group.__________Published in Ukrains’kyi Matematychnyi Zhurnal, Vol. 56, No. 10, pp. 1335 – 1341, October, 2004.     

Groups of binary relations

It was shown in [3] that every finite group is the maximal subgroup of a semigroupB _x of all binary relations on some finite set X. This result is extended here to arbitrary groups.     

Dedekind 群的一个刻画

本文给出了Dedekind群的一个刻画.即如果一个群G有一个无不动点的弱幂同构,则G是一个Dedekind群.     

Finite Homomorphic Images of Groups of Finite Rank

Let π be a finite set of primes. We prove that each soluble group of finite rank contains a finite index subgroup whose every finite homomorphic π-image is nilpotent. A similar assertion is proved for a finitely generated group of finite rank. These statements are obtained as a consequence of the following result of the article: Each soluble pro-π-group of finite rank has an open normal pronilpotent subgroup.

     

Semicharacters of Groups

We define the notion of a semicharacter of a group G: A function from the group to ?*, whose restriction to any abelian subgroup is a homomorphism. We conjecture that for any finite group, the order of the group of semicharacters is divisible by the order of the group. We prove that the conjecture holds for some important families of groups, including the Symmetric groups and the groups GL(2, q).