特征标表中每列至多有p个零点的有限奇阶群

给出了奇阶群的特征标表中每列至多有P个零点(p是群的阶的最小素因子)的群的结构.     

关于有限群特征标值的两点注记

通过计算群中的对合数，本文刻画了以下两类有限群：特征标表中有一行至多有两个有理值的有限群；特征标表中有一列至多有两个实数值的有限群．     

有限群的特征标的零点和可解φ-群

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

关于有限群不可约特征标零点的一点注记

在这篇文章中,我们分类了每一个非线性不可约特征标的零点集最多由$3$个共轭类组成的有限亚交换群的结构.     

关于有限p-群特征标值的一个注记(英文)

本文考虑了Yakov berkovich提出的一个研究问题.利用特征标理论的初等技巧,得到每个不可约特征标至多有p个不同值的有限p-群一定是初等交换p-群,这部分回答了Yakov berkovich的研究问题.     

特征标表中零点个数很少的有限可解群

（１）与（２）均曾研究过有某特征标恰在两个共轭类上取非零值的有限群。本文讨论上述情形的另一极端,即每个不可约特征标至多在ｐ个共轭类上取零值的有限可解群,这里ｐ为群阶的最小素因子,通过对极小非交换商群的分析,我们将刻划这类群的结构。     

特征标次数的重数与可解群结构

非线性不可约特征标次数的重数全部为1的有限群的分类是熟知的.对可解群,本文讨论更一般的,即非线性不可约特征标次数的重数都与群阶互素的有限群的纯群论性质.特别地,得到了非线性不可约特征标次数的重数均小于2p的奇阶群G的分类结果.这里p为群阶|G|的最小素因子.     

非线性不可约特征标维数相等且为素数个的有限群

对于具有素数个非线性不可约特征标且它们的维数相等的有限群,我们给出一个分类.     

关于π''''-次数的不可约特征标在π-可分群里的一个注记

这篇文章中,我们研究了一种有限π-可分群G,它的每一个非线性不可约特征标是π-次的,得到了G是π-群的一个等价条件,并且给出了一些群理论的特征.     

关于π′-次数的不可约特征标在π-可分群里的一个注记(英文)

这篇文章中 ,我们研究了一种有限π -可分群G ,它的每一个非线性不可约特征标是π -次的 ,得到了G是π -群的一个等价条件 ,并且给出了一些群理论的特征。     

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.     

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.     

A New Characterization of Simple K 3-Groups by 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 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 ₃-groups by their orders and one or two irreducible character degrees of their character tables.     

Finite Groups in Which Each Irreducible Character has at Most Two Zeros

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:     

Tensor product of C-injective modules

The purpose of this paper is to calculate all the character tables of Hecke algebras associated with finite Chevalley groups of exceptional type and their maximal parabolic subgroups when they are commutative. In the case when the groups are of classical type, the character values of Hecke algebras are expressed by using the q-Krawtchouk polynomials and the q-Hahn polynomials (See [10] and [15]). On the other hand, the character tables of commutative Hecke algebras associated with exceptional Weyl groups and their maximal parabolic subgroups are given in [12]. In §1, we discuss the structure of Hecke algebras and in §2, we calculate all the character tables of these commutative Hecke algebras associated with finite Chevalley groups of exceptional type. Although some of them are well known, we include them for completeness     

A characterization of almost simple K 3-groups

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 K₃-groups by their orders and at most three irreducible character degrees of their character tables.     

Character tables of p-groups with derived subgroup of prime order I

Two character tables of finite groups are isomorphic if there exist a bijection for the irreducible characters and a bijection for the conjugacy classes that preserve all the character values. We give necessary and sufficient conditions for two finite groups to have isomorphic character tables. In the case of finite p-groups with derived subgroup of order p, we show that the character tables can be classified by equivalence classes of certain homomorphisms of abelian p-groups.     

Conditional Inference on Tables With Structural Zeros

We develop a set of sequential importance sampling (SIS) strategies for sampling nearly uniformly from two-way zero-one or contingency tables with fixed marginal sums and a given set of structural zeros. The SIS procedure samples tables column by column or cell by cell by using appropriate proposal distributions, and enables us to approximate closely the null distributions of a number of test statistics involved in such tables. When structural zeros are on the diagonal or follow certain patterns, more efficient SIS algorithms are developed which guarantee that every generated table is valid. Examples show that our methods can be applied to make conditional inference on zero-one and contingency tables, and are more efficient than other existing Monte Carlo algorithms.