关于有限群两个超可解子群之积的问题

In this paper, we give some sufficient conditions for products of two supersolvable sub-groups to be supersolvable groups. Our results generalize some known results.Theorem 1 Let G = HK,(|H|,|K|) = 1, Where H and K are two supersolvable sub-groups. If H is commutative with every maximal subgroup of K, and K is commutative with every maximal subgroup of H, then G is supersolvable.Theorem 2 Let G = HK, H ∩ K = 1, H G, and K be quasinormal in H. If H, K are supersolvable, the G is supersolvable.Theorem 3 Let G= HK,(|H|,|K|) = 1,H,K be two supersolvable subgroups. If H is commutative with any Sylow subgroup of K and any maximal subgroup of every sylow subgroup of K, and K is commutative with any sylow subgroup of H and any maximal subgroup of every sylow subgroup of H, then G is supersolvable. Theorem 4 If H,K are two supersolvable subgroups of G, G= HK, G′is nilpotent, H is quasi normal K, and K is quasi normal in H,then G is supersolvable. Theorem 5 If H,K are two supersolvable subgroups of G, G= HK, H′? G,[H,K]? G,[H,K] is nilpotent, H is quasi normal in K, and K is quasi normal in H,then G is supersolvable.     

Derangement Characters of the Finite General Linear Group

We focus on derangement characters of GL(n,q) which depend solely on the dimension of the space of fixed vectors. This family includes Thoma characters which become asymptotically irreducible as n→∞. We find explicit decomposition of Thoma characters into irreducibles, construct further derangement characters and seek for extremes in the family derangement characters. Presented by A. VerschorenMathematics Subject Classification (2000) 20C15.     

Generalized Blocks of Unipotent Characters in the Finite General Linear Group

In an article of 2003, Külshammer, Olsson, and Robinson defined ?-blocks for the symmetric groups, where ? > 1 is an arbitrary integer, and proved that they satisfy an analogue of the Nakayama Conjecture. Inspired by this work and the definitions of generalized blocks and sections given by the authors, we give in this article a definition of d-sections in the finite general linear group, and construct d-blocks of unipotent characters, where d ≥ 1 is an arbitrary integer. We prove that they satisfy one direction of an analogue of the Nakayama Conjecture, and, in some cases, prove the other direction. We also prove that they satisfy an analogue of Brauer's Second Main Theorem.     

Linear Codes and Their Coordinate Ordering

A necessary and sufficientcondition for a q-ary code to satisfy the two-waychain condition (TCC) is found. A known construction of q-arycodes is shown to yield codes satisfying the TCC. Some q-arycodes of dimension k 6 meeting the Griesmerbound are proved to satisfy the TCC.     

有限交换环上极限线性群的Sylowp—子群

本文给出了有限交换局部环Ｒ上无限线性群ＧＬ（Ｒ）＝∪ｎＧＬｎＲ的Ｓｙｌｏｗｐ－子群的形式．令Ｍ是有限交换局部环Ｒ的唯一极大理想，ｋ＝Ｒ／Ｍ为Ｒ的剩余类域．用Ｘ（ｋ）表示ｋ的特征，并假定Ｐ与ｘ（ｋ）互素．作者证明了：ＧＬ（Ｒ）的任一Ｓｙｌｏｗｐ－子群Ｓ或者同构于的可数无限直积与Ｐ（ｊ）的无限直积的直积（当Ｐ≠２或Ｐ＝２，Ｘ（ｋ）β≡１（ｍｏｄ４））或者同构于Ｐｉ的无限直积与Ｐ（ｊ）的无限直积的直积（当Ｐ＝２，Ｘ（ｋ）β≡３（ｍｏｄ４）），这里，只是ＧＬ（ｅｐｉ）Ｒ（分别地，ＧＬ（２ｒｉ）Ｒ）的Ｓｙｌｏｗｐ－子群，Ｐ（ｊ））同构于Ｐ＝∪ｉ∈Ｉｐｉ，Ｉ是可数集．     

The Linear Ordering Problem with cumulative costs

The optimization problem of finding a permutation of a given set of items that minimizes a certain cost function is naturally modeled by introducing a complete digraph G whose vertices correspond to the items to be sorted. Depending on the cost function to be used, different optimization problems can be defined on G. The most familiar one is the min-cost Hamiltonian path problem (or its closed-path version, the Traveling Salesman Problem), arising when the cost of a given permutation only depends on consecutive node pairs. A more complex situation arises when a given cost has to be paid whenever an item is ranked before another one in the final permutation. In this case, a feasible solution is associated with an acyclic tournament (the transitive closure of an Hamiltonian path), and the resulting problem is known as the Linear Ordering Problem (LOP).     

Fusion Procedure for Wreath Products of Finite Groups by the Symmetric Group

Let G be a finite group. A complete system of pairwise orthogonal idempotents is constructed for the wreath product of G by the symmetric group by means of a fusion procedure, that is by consecutive evaluations of a rational function with values in the group ring. This complete system of idempotents is indexed by standard Young multi-tableaux. Associated to the wreath product of G by the symmetric group, a Baxterized form for the Artin generators of the symmetric group is defined and appears in the rational function used in the fusion procedure.     

Coherent Functors and Covariantly Finite Subcategories

Given a locally presentable additive category A, we study a class of covariantly finite subcategories which we call definable. A definable subcategory arises from a set of coherent functors F _i on A by taking all objects X in A such that F _i X=0 for all i. We give various characterizations of definable subcategories, demonstrating that all covariantly finite subcategories which arise in practice are of this form. This is based on a filtration of the category of all coherent functors on A.     

Linear Representations of the Automorphism Group of a Free Group

Let F _n be the free group on n ≥ 2 elements and Aut(F _n ) its group of automorphisms. In this paper we present a rich collection of linear representations of Aut(F _n ) arising through the action of finite-index subgroups of it on relation modules of finite quotient groups of F _n . We show (under certain conditions) that the images of our representations are arithmetic groups. Received: November 2006, Accepted: March 2007     

An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem

Scatter search is a population-based method that has recently been shown to yield promising outcomes for solving combinatorial and nonlinear global optimization problems. Based on formulations originally proposed in the 1960s for combining decision rules and problem constraints, such as in generating surrogate constraints, scatter search uses strategies for combining solution vectors that have proved effective in a variety of problem settings. In this paper, we present a scatter search implementation designed to find high quality solutions for the NP-hard linear ordering problem, which has a significant number of applications in practice. The LOP, for example, is equivalent to the so-called triangulation problem for input-output tables in economics. Our implementation incorporates innovative mechanisms to combine solutions and to create a balance between quality and diversification in the reference set. We also use a tracking process that generates solution statistics disclosing the nature of combinations and the ranks of antecedent solutions that produced the best final solutions. Extensive computational experiments with more than 300 instances establishes the effectiveness of our procedure in relation to approaches previously identified to be best.     

Fitting Height of a Finite Group with a Metabelian Group of Automorphisms

Let M = FH be a finite group that is a product of a normal abelian subgroup F and an abelian subgroup H. Assume that all elements in M?F have prime order p, and F has at most one subgroup of order p. Examples of such groups are dihedral groups for p = 2 and the semidirect product of a cyclic group F by a group H of prime order p such that C _F (H) = 1 or |C _F (H)| =p and C _{F/C F (H)}(H) = 1. Suppose that M acts on a finite group G in such a manner that C _G (F) = 1. We prove that the Fitting height h(G) of G is at most h(C _G (H))+ 1. Moreover, the Fitting series of C _G (H) coincides with the intersection of C _G (H) with the Fitting series of G.     

The Existence of p-blocksof a Finite Group With a Given Defect Group

Brauer's problem 19［B］——in terms of group theoreticalproperties count the number of p-blocks with a given defect group——has been studied by many authors.Among them G. R. Robinson gave a pricise formula for the number. Of courseit is by no means easy to calculate by the formula. So it is still interesting tofind other formula counting the number or conditions for the existence ofp-blocks.     

Finite Linear Spaces II

Batten and Beutelspacher have characterized Finite Linear Spaces with lines of size n,n + 1 and n + 2, and with v (n + 1)²for n 22, and some of the cases for smaller n. In this article, using the structuredapproach we presented in our earlier article [8], we complete this characterization for smalln.     

Generic Idempotent Modules for a Finite Group

Let G be a finite group and k an algebraically closed field of characteristic p. Let F _U be the Rickard idempotent k G-module corresponding to the set U of subvarieties of the cohomology variety V _G which are not irreducible components. We show that F _U is a finite sum of generic modules corresponding to the irreducible components of V _G . In this context, a generic module is an indecomposable module of infinite length over k G but finite length as a module over its endomorphism ring.     

有限群的X-s-置换子群

Let X be a nonempty subset of a group G.A subgroup H of G is said to be X-s-permutable in G if there exists an element x ∈ X such that HPx = PxH for every Sylow subgroup P of G.In this paper,some new results are given under the assumption that some suited subgroups of G are X-s-permutable in G.     

表特殊线性群中元素为平延换位子之积

考虑元素了数大于3的域F上的特殊线性群SLnF.对GLnF中任一矩阵A,记resA为A－I的秩,称矩阵A为平延,如果resA=I并且 detA=1,对n≥2,本文证明SLnF中任一矩阵都可写成不超过[resA/2] 2个平延换位子之积。