On permutation representations of polyhedral groups

We answer affirmatively the following question of Derek Holt: Given integers , can one, in a simple manner, find a finite set and permutations such that has order , has order and has order ? The method of proof enables us to prove more general results (Theorems 2 and 3).

     

Universal families of permutation groups

For several families ℱ of finite transitive permutation groups it is shown that each finite group is isomorphic to a 2-point stabilizer of infinitely many members of ℱ. This research was supported in part by NSF grants DMS 9301308 and DMS 0242983.     

Maximal covers of finite groups

Abstract

Let λ(G) be the maximum number of subgroups in an irredundant covering of the finite group G. We prove that if G is a group with λ(G) ≤ 6, then G is supersolvable. We also describe the structure of groups G with λ(G) = 6. Moreover, we show that if G is a group with λ(G)?<?31, then G is solvable.     

Permutation polytopes and indecomposable elements in permutation groups

Each group G of n×n permutation matrices has a corresponding permutation polytope, P(G):=conv(G)⊂Rn×n. We relate the structure of P(G) to the transitivity of G. In particular, we show that if G has t nontrivial orbits, then min{2t,⌊n/2⌋} is a sharp upper bound on the diameter of the graph of P(G). We also show that P(G) achieves its maximal dimension of ²(n−1) precisely when G is 2-transitive. We then extend the results of Pak [I. Pak, Four questions on Birkhoff polytope, Ann. Comb. 4 (1) (2000) 83-90] on mixing times for a random walk on P(G). Our work depends on a new result for permutation groups involving writing permutations as products of indecomposable permutations.     

Linear optimization over permutation groups

For a permutation group given by a set of generators, the problem of finding “special” group members is NP-hard in many cases, e.g., this is true for the problem of finding a permutation with a minimum number of fixed points or a permutation with a minimal Hamming distance from a given permutation. Many of these problems can be modeled as linear optimization problems over permutation groups. We develop a polyhedral approach to this general problem and derive an exact and practically fast algorithm based on the branch & cut-technique.     

A characterization of finite simple groups by the orders of solvable subgroups

Let G be a finite group and S be a finite simple group. In this paper, we prove that if G and S have the same sets of all orders of solvable subgroups, then G is isomorphic to S, or G and S are isomorphic to Bn(q), Cn(q), where n≥3 and q is odd. This gives a positive answer to the problem put forward by Abe and Iiyori.     

The Siegel norm,the length function and character values of finite groups

In this paper we present some new results on the connection between the Siegel norm, the length function and irreducible character values of finite groups. In addition, we provide algorithms to compute the length of a cyclotomic integer and the set of cyclotomic integers with Siegel norm bounded by a given positive real number.     

On finite groups with non-subnormal subgroups

For a finite group G, let n(G) denote the number of conjugacy classes of non-subnormal subgroups of G. In this paper, we show that a finite group G satisfying n(G)≤2|π(G)| is solvable, and for a finite non-solvable group G, n(G) = 2|π(G)|+1 if and only if G?A₅.     

有限群极大子群的强θ*-完备

首次给出有限群极大子群的强θ^＊-完备的定义，利用这一概念得到关于群可解性、超可解性的新的充要条件．     

A local conjecture on Brauer character degrees of finite groups

Recently, a new conjecture on the degrees of the irreducible Brauer characters of a finite group was presented by W. Willems. In this paper we propose a `local' version of this conjecture for blocks of finite groups, giving a lower bound for where the sum runs through the set of irreducible Brauer characters of in terms of invariants of . A slight reformulation leads to interesting open questions about traces of Cartan matrices of blocks.

We show that the local conjecture is true for blocks with one simple module, blocks of -solvable groups and blocks with cyclic defect groups. It also holds for many further examples of blocks of sporadic groups, symmetric groups or groups of Lie type. Finally we prove that the conjecture is true for blocks of tame representation type.

     

New classes of permutation binomials and permutation trinomials over finite fields

Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, communication theory and so on. Permutation binomials and permutation trinomials attract people's interest due to their simple algebraic forms and additional extraordinary properties. In this paper, we find a new result about permutation binomials and construct several new classes of permutation trinomials. Some of them are generalizations of known ones.     

On character groups arising from dimension groups

Character groups associated with certain dimension groups are considered. It is shown how these character groups can be used to construct an AF groupoid whose dimension group is isomorphic to the original dimension group.

     

Essential cohomology of finite groups

In this paper we prove that a finite group G with Cohen-Macaulay mod p cohomology will have non-trivial undetectable elements in if and only if G is a p-group such that every element of order p in G is central. Applications and examples are also provided. Received: April 18, 1996     

Positions of characters in finite groups and the Taketa inequality

We define the position of an irreducible complex character of a finite group as an alternative to the degree. We then use this to define three classes of groups: position reducible (PR)-groups, inductively position reducible (IPR)-groups and weak IPR-groups. We show that IPR-groups and weak IPR-groups are solvable and satisfy the Taketa inequality (ie, that the derived length of the group is at most the number of degrees of irreducible complex characters of the group), and we show that any M-group is a weak IPR-group. We also show that even though PR-groups need not be solvable, they cannot be perfect.     

On finite soluble groups in which Sylow permutability is a transitive relation

A characterisation of finite soluble groups in which Sylow permutability is a transitive relation by means of subgroup embedding properties enjoyed by all the subgroups is proved. The key point is an extension of a subnormality criterion due to Wielandt. This revised version was published online in June 2006 with corrections to the Cover Date.     

A conjecture of Abe-Iiyori and the Ree groups 2F4(q),Ⅱ

In this paper the author has solved a problem of Abe and liyori for the finite simple groups 2F4(q) and 2F4(2)'.     

三个或多个素变数的线性方程

设G是有限群,p是|G|的一个素因子,P是G的一个Sylow p-子群.若下列条件之一满足,则G是p-幂零:(1)P的极大子群均在G中S-半正规且(|G|,p-1)=1;(2)P的二次极大子群均在G中S-半正规且(|G|,p2-1)=1.