On the Orbit Sizes of Permutation Groups on the Power Set

We study the action of finite permutation groups of odd order on the power set of a set on which they act naturally, and establish a theorem that guarantees the existence of a lot of distinct orbit sizes in this action.1991 Mathematics Subject Classification: 20B05     

Nearly Linear Time Algorithms for Permutation Groups: An Interplay Between Theory and Practice

We survey polynomial time algorithms (both deterministic and random) for computations with permutation groups. Particular emphasis is given to algorithms with running time of the form O(n log ^c |G|), where G is a permutation group of degree n. In the case of small-base groups, i.e., when log |G| is polylogarithmic as a function of n, such algorithms run in nearly linear, O(n log^c' n) time. Important classes of groups, including all permutation representations of simple groups except the alternating ones, as well as most primitive groups, belong to this category. For large n, the majority of practical computations is carried out on small-base groups.In the last section, we present some new nearly linear time algorithms, culminating in the computation of the upper central series in nilpotent groups.     

Subgroups of Free Groups: a Contribution to the Hanna Neumann Conjecture

We prove that the strengthened Hanna Neumann conjecture, on the rank of the inter-section of finitely generated subgroups of a free group, holds for a large class of groups characterized by geometric properties. One particular case of our result implies that the conjecture holds for all positively finitely generated subgroups of the free group F(A) (over the basis A), that is, for subgroups which admit a finite set of generators taken in the free monoid over A.     

Distribution of the Logarithm of the Order of a Random Permutation

We consider the convergence rate of the distribution of the logarithm of the order of a random permutation on subsets of the symmetric group to the normal law.     

谈谈与图有关的几种复形的同调群

我们从组合拓扑方法在图论的应用中,着重介绍与图有关的几种复形的近期研究动态,论述其中一些基础性的问题,并提出一些可供研究的新问题。     

The Numbers of Permutation Groups Orbits and of the Wreath Product Orbits

ＴｈｅＮｕｍｂｅｒｓｏｆＰｅｒｍｕｔａｔｉｏｎＧｒｏｕｐｓＯｒｂｉｔｓａｎｄｏｆｔｈｅＷｒｅａｔｈＰｒｏｄｕｃｔＯｒｂｉｔｓ￥ＬｉＸｉａｎｚｈｏｎｇ；ＬｉｕＧｕａｎｇｌｉａｎｇ（ＰｕｙａｎｇＥｄｕｃａｔｉｏｎａｌＣｏｌｌｅｇｅ，Ｈｅｎａｎ，４５７００...     

On Permutation Groups of Degree a Product of Two Prime-Powers

We determine finite simple groups which have a subgroup of index with exactly two distinct prime divisors. Then from this we derive a classification of primitive permutation groups of degree a product of two prime-powers.     

Seminormal Representations of Weyl Groups and Iwahori-Hecke Algebras

The purpose of this paper is to describe a general procedurefor computing analogues of Young's seminormal representationsof the symmetric groups. The method is to generalize the Jucys-Murphyelements in the group algebras of the symmetric groups to arbitraryWeyl groups and Iwahori-Hecke algebras. The combinatorics ofthese elements allows one to compute irreducible representationsexplicitly and often very easily. In this paper we do thesecomputations for Weyl groups and Iwahori-Hecke algebras of typesA_n, B_n, D_n, G₂. Although these computations are in reach fortypes F₄, E₆ and E₇, we shall postpone this to another work.1991 Mathematics Subject Classification: primary 20F55, 20C15;secondary 20C30, 20G05.     

Factorizations of Finite Groups and Related Topics

This is a survey on the recent progress in the theory of finite groups with factorizations and around it,done by the author and his coauthors,and this has no pretensions to cover all topics in this wide area of research.In particular,we only touch the great consequences of the fundamental paper of Liebeck,Praeger and Saxl on maximal factorizations of almost simple finite groups for the theory of groups with factorizations.In each case the reader can find additional references at the end of Section 1.Some of the methods of investigation can be used to obtain information about finite groups in general,nilpotent algebras and related nearrings.     

The Multiplicity Free Permutation Representations of the Ree Groups 2 G 2(q), the Suzuki Groups 2 B 2(q), and Their Automorphism Groups

Abstract

Let G a simple group of type ² B ₂(q) or ² G ₂(q), where q is an odd power of 2 or 3, respectively. The main goal of this paper is to determine the multiplicity free permutation representations of G and A ≤ Aut(G) where A is a subgroup containing a copy of G. Let B be a Borel subgroup of G. If G = ² B ₂(q) we show that there is only one non-trivial multiplicity free permutation representation, namely the representation of G associated to the action on G/B. If G = ² G ₂(q) we show that there are exactly two such non-trivial representations, namely the representations of G associated to the action on G/B and the action on G/M, where M = UC with U the maximal unipotent subgroup of B and C the unique subgroup of index 2 in the maximal split torus of B. The multiplicity free permutation representations of A correspond to the actions on A/H where H is isomorphic to a subgroup containing B if G = ² B ₂(q), and containing M if G = ² G ₂(q). The problem of determining the multiplicity free representations of the finite simple groups is important, for example, in the classification of distance-transitive graphs.     

Galois Stability, Integrality and Realization Fields for Representations of Finite Abelian Groups

For a given field F of characteristic 0 we consider a normal extension E/F of finite degree d and finite Abelian subgroups GGL _n (E) of a given exponent t. We assume that G is stable under the natural action of the Galois group of E/F and consider the fields E=F(G) that are obtained via adjoining all matrix coefficients of all matrices gG to F. It is proved that under some reasonable restrictions for n, any E can be realized as F(G), while if all coefficients of matrices in G are algebraic integers, there are only finitely many fields E=F(G) for prescribed integers n and t or prescribed n and d.     

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.     

可换环上一类矩阵代数的导子和自同构

决定了含幺可换环上一类矩阵代数的所有导子和所有自同构.     

Bounded Rank Subgroups of Coxeter Groups, Artin Groups and One-Relator Groups with Torsion

We obtain a number of results regarding the freeness of subgroupsof Coxeter groups, Artin groups and one-relator groups withtorsion. In the case of Coxeter groups, we also obtain resultson quasiconvexity and subgroup separability. 2000 MathematicsSubject Classification 20F65, 20F55, 20F36, 20F06.     

特征标次数图是一种连通图的单群

对有限单群G,假设其不可约特征标次数图Δ(G)连通,且图顶点集ρ(G)=π_1∪π_2∪{p},其中|π_1|,|π_2|≥1,π_1∩π_2=θ,且π_1与π_2中顶点不相邻.证明了Δ(G)满足上面的假设的有限单群G只有4种:M_(11),J_1,PSL_3(4)或²B_2(q2B_2(q²),其中q2),其中q²一1是Mersenne素数.     

Extensions of Modules over Schur Algebras, Symmetric Groups and Hecke Algebras

We study the relation between the cohomology of general linear and symmetric groups and their respective quantizations, using Schur algebras and standard homological techniques to build appropriate spectral sequences. As our methods fit inside a much more general context within the theory of finite-dimensional algebras, we develop our results first in that general setting, and then specialize to the above situations. From this we obtain new proofs of several known results in modular representation theory of symmetric groups. Moreover, we reduce certain questions about computing extensions for symmetric groups and Hecke algebras to questions about extensions for general linear groups and their quantizations.     

Permutation Matrices, Wreath Products, and the Distribution of Eigenvalues

We consider a class of random matrix ensembles which can be constructed from the random permutation matrices by replacing the nonzero entries of the n×n permutation matrix matrix with M×M diagonal matrices whose entries are random Kth roots of unity or random points on the unit circle. Let X be the number of eigenvalues lying in a specified arc I of the unit circle, and consider the standardized random variable (X–E[X])/(Var(X))^1/2. We show that for a fixed set of arcs I ₁,...,I _N , the corresponding standardized random variables are jointly normal in the large n limit, and compare the covariance structures which arise with results for other random matrix ensembles.     

Williamson Matrices and a Conjecture of Ito's

We point out an interesting connection between Williamson matrices and relative difference sets in nonabelian groups. As a consequence, we are able to show that there are relative (4t, 2, 4t, 2t)-difference sets in the dicyclic groups Q _8t = a, b|a ^4t = b ⁴ = 1, a ^2t = b ², b ^-1ab = a^-1 for all t of the form t = 2^a · 10 ^b · 26 ^c · m with a, b, c 0, m 1\ (mod 2), whenever 2m-1 or 4m-1 is a prime power or there is a Williamson matrix over _m. This gives further support to an important conjecture of Ito IT5 which asserts that there are relative (4t, 2, 4t, 2t)-difference sets in Q _8t for every positive integer t. We also give simpler alternative constructions for relative (4t, 2, 4t, 2t)-difference sets in Q _8t for all t such that 2t - 1 or 4t - 1 is a prime power. Relative difference sets in Q _8t with these parameters had previously been obtained by Ito IT1. Finally, we verify Ito's conjecture for all t 46.