首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
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.  相似文献   

2.
Haijing Xu  Yanxiong Yan 《代数通讯》2013,41(12):5374-5380
It is a well-known fact that characters of a finite group can give important information of the structure of the group. Also it was proved by the second author that a finite simple group can uniquely determined by its character table. Here the authors attempt to investigate how to characterize a finite group by using less information of its character table, and successfully characterize K 3-groups by their orders and one or two irreducible character degrees of their character tables.  相似文献   

3.
It is a well-known fact that characters of a finite group can give important information about the group's structure. Also it was proved by the third author of this article 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 almost simple K3-groups by their orders and at most three irreducible character degrees of their character tables.  相似文献   

4.
Finite Groups in Which Each Irreducible Character has at Most Two Zeros   总被引:2,自引:0,他引:2  
Let G be a finite group, Irr(G) denotes the set of irreducible complex characters of G and gG the conjugacy class of G containing element g. A well-known theorem of Burnside([1,Theorem 3.15]) states that every nonlinear X ∈ Irr(G) has a zero on G, that is, an element x (or a conjugacy class xG) of G with X(x) = 0. So, if the number of zeros of character table is very small, we may expect, the structure of group is heavily restricted. For example, [2, Proposition 2.7] claimes that G is a Frobenius group with a complement of order 2 if each row in charcter table has at most one zero (its proof uses the classification of simple groups). In this note, we characterize the finite group G satisfying the following hypothesis:  相似文献   

5.
特征标表各列零点个数不超过2个的有限群   总被引:1,自引:0,他引:1  
继续考虑特征标的零点对有限群结构的影响, 并给出了特征标表中 每列至多有两个零点的有限群的分类,从而完成了特征标表中每列至多 $p$ ($p$是群的阶的最小素因子)个零点的有限群的完全分类.  相似文献   

6.
If the character table of a finite group H satisfies certain conditions, then the classes and characters of H can fuse to give the character table of a group G of the same order. We investigate the case where H is an abelian group. The theory is developed in terms of the S-rings of Schur and Wielandt. We discuss certain classes of p-groups which fuse from abelian groups and give examples of such groups which do not. We also show that a large class of simple groups do not fuse from abelian groups. The methods to show fusion include the use of extensions which are Camina pairs, but other techniques on S-rings are also developed.  相似文献   

7.
We give two ways to distinguish from the character table of a finite group G if a Sylow 2-subgroup of G has maximal class. We also characterize finite groups with Sylow 3-subgroups of order 3 in terms of their principal 3-block.  相似文献   

8.
The special linear group is the simply connected group and theprojective linear group is the adjoint group of Lie type An.They are distinguished sections of the (reductive) general lineargroup which certainly is of this type as well (root system).We shall characterize the general linear group as the universalgroup of type An. Indeed we shall introduce corresponding algebraicgroups and finite groups for each Lie type (to indecomposableroot systems). Knowledge of the universal group implies knowledgeof the related simply connected and adjoint groups; in certainrespects the universal group even appears to be better behaved(automorphisms, Schur multiplier, character table).  相似文献   

9.
有两个对偶的问题如下:问题Ⅰ:将满足下述条件的有限群G分类:G的特征标表中,除一行外其余各行最多有一个零.问题Ⅱ:将满足下述条件的有限群G分类:G的特征标表中,除一列外其余各列最多有一个零.在这篇文章中,我们对于有限可解群解答上述两个问题,并确定和这两个问题密切相关的一类有限可解群的结构(这类可解群在本文中称之为可解φ-群).附带我们还完全回答了[4]中的问题1,并说明[6,定理]的条件可以极大地减弱.  相似文献   

10.
Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups   总被引:1,自引:0,他引:1  
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.  相似文献   

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

12.
称有限群的不可约特征标x为SM-特征标,如果x可由某个次正规子群的线性特征标诱导得到.称有限群为SM-群,如果有限群的所有不可约特征标均为SM-特征标.通过一个例子,将说明rp~3-阶群不一定是SM-群.  相似文献   

13.
An affine module group is a semidirect extension of an additive module group by its automorphism group. Maximal Abelian normal subgroups of an affine group are described. It is proved that operator isomorphisms of affine groups are induced by module automorphisms. Automorphisms of an affine group which do not leave a module fixed are treated. And conditions are specified for a module to be non-characteristic in its affine group.  相似文献   

14.
We prove that any finite group of order 16 is determined by its endomorphism semigroup in the class of all groups. __________ Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 14, Algebra, 2004.  相似文献   

15.
钱国华 《数学进展》2003,32(4):461-465
通过计算群中的对合数,本文刻画了以下两类有限群:特征标表中有一行至多有两个有理值的有限群;特征标表中有一列至多有两个实数值的有限群.  相似文献   

16.
特征标次数的重数与可解群结构   总被引:2,自引:1,他引:1  
钱国华 《数学学报》2004,47(1):125-130
非线性不可约特征标次数的重数全部为1的有限群的分类是熟知的.对可解群,本文讨论更一般的,即非线性不可约特征标次数的重数都与群阶互素的有限群的纯群论性质.特别地,得到了非线性不可约特征标次数的重数均小于2p的奇阶群G的分类结果.这里p为群阶|G|的最小素因子.  相似文献   

17.
Motivated by topological quantum field theory, we investigate the geometric aspects of unitary 2-representations of finite groups on 2-Hilbert spaces, and their 2-characters. We show how the basic ideas of geometric quantization are ‘categorified’ in this context: just as representations of groups correspond to equivariant line bundles, 2-representations of groups correspond to equivariant gerbes. We also show how the 2-character of a 2-representation can be made functorial with respect to morphisms of 2-representations. Under the geometric correspondence, the 2-character of a 2-representation corresponds to the geometric character of its associated equivariant gerbe. This enables us to show that the complexified 2-character is a unitarily fully faithful functor from the complexified Grothendieck category of unitary 2-representations to the category of unitary conjugation equivariant vector bundles over the group.  相似文献   

18.
Jinbao Li 《代数通讯》2013,41(7):2971-2983
In the past thirty years, several kinds of quantitative characterizations of finite groups especially finite simple groups have been investigated by many mathematicians. Such as quantitative characterizations by group order and element orders, by element orders alone, by the set of sizes of conjugacy classes, by dimensions of irreducible characters, by the set of orders of maximal abelian subgroups and so on. Here the authors continue this topic in a new area tending to characterize finite simple groups with given orders by some special conjugacy class sizes, such as largest conjugacy class sizes, smallest conjugacy class sizes greater than 1 and so on.  相似文献   

19.
We characterize some classical quadrangles by means of properties of their groups of projectivities. In particular, we characterize all finite classical quadrangles with regular lines, and all symplectic quadrangles over quadratically closed fields.  相似文献   

20.
In this paper we characterise finite groups whose character tables fuse from the character table of a cyclic group. We also show a connection with a generalisation of the Camina pair condition introduced by Camina in [Ca].  相似文献   

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

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