The Round Functions of Cryptosystem PGM Generate the Symmetric Group

S. S. Magliveras et al. have described symmetric and public key cryptosystems based on logarithmic signatures (also known as group bases) for finite permutation groups. In this paper we show that if G is a nontrivial finite group which is not cyclic of order a prime, or the square of a prime, then the round (or encryption) functions of these systems, that are the permutations of G induced by the exact-transversal logarithmic signatures (also known as transversal group bases), generate the full symmetric group on G. This answers a question of S. S. Magliveras, D. R. Stinson and Tran van Trung. AMS Classification:94A60, 20B15, 20B20     

A decomposition theorem for G-groups

Some classical results about linear representations of a finite group G have been also proved for representations of G on non-abelian groups （G-groups）. In this paper we establish a decomposition theorem for irreducible G-groups which expresses a suitable irreducible G-group as a tensor product of two projective G-groups in a similar way to the celebrated theorem of Clifford for linear representations. Moreover, we study the non-abelian minimal normal subgroups of G in which this decomposition is possible.     

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.     

On Some Sets of Group Functions

Let G be a group, let A be an Abelian group, and let n be an integer such that n –1. In the paper, the sets _n (G,A) of functions from G into A of degree not greater than n are studied. In essence, these sets were introduced by Logachev, Sal'nikov, and Yashchenko. We describe all cases in which any function from G into A is of bounded (or not necessarily bounded) finite degree. Moreover, it is shown that if G is finite, then the study of the set _n (G,A) is reduced to that of the set n(G/O ^p (G),A _p ) for primes p dividing G/G. Here O ^p (G) stands for the p-coradical of the group G, A _p for the p-component of A, and G for the commutator subgroup of G.     

关于一类魔方玩具变换群的讨论

研究了一类魔方玩具的变换群.利用确定生成元的方法,确定了这一类魔方玩具的变换群.     

Some Results on the Problems of Block Theory

In this paper, we obtain two results on Brauer‘s k (B) - problem about finite groups under some conditions. Furthermore, we obtain that Olsson‘s conjecture holds under the same conditions on the finite groups.     

关于Weyl群的某些研究

记 Φ为欧氏空间 V中某不可约根系 ,具有 Weyl群 W,记 σ为 W中满足条件 w( Φ+ ) =Φ-的唯一元 .本文考虑如何将 σ分解成反射之积 ;σ在 Φ上的作用方式如何 .作为应用确定了 W的中心 ;进一步确定了 V的一类子空间在 W中的固定子群 .     

A Hecke Algebra Quotient and Some Combinatorial Applications

Let (W, S) be a Coxeter group associated to a Coxeter graph which has no multiple bonds. Let H be the corresponding Hecke Algebra. We define a certain quotient \-H of H and show that it has a basis parametrized by a certain subset W _cof the Coxeter group W. Specifically, W _cconsists of those elements of W all of whose reduced expressions avoid substrings of the form sts where s and t are noncommuting generators in S. We determine which Coxeter groups have finite W _cand compute the cardinality of W _cwhen W is a Weyl group. Finally, we give a combinatorial application (which is related to the number of reduced expressions for w W _cof an exponential formula of Lusztig which utilizes a specialization of a subalgebra of \-H.     

On the Cameron-Praeger conjecture

This paper takes a significant step towards confirming a long-standing and far-reaching conjecture of Peter J. Cameron and Cheryl E. Praeger. They conjectured in 1993 that there are no non-trivial block-transitive 6-designs. We prove that the Cameron-Praeger conjecture is true for the important case of non-trivial Steiner 6-designs, i.e. for 6-(v,k,λ) designs with λ=1, except possibly when the group is PΓL(2,pe) with p=2 or 3, and e is an odd prime power.     

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     

A census of highly symmetric combinatorial designs

As a consequence of the classification of the finite simple groups, it has been possible in recent years to characterize Steiner t-designs, that is t-(v,k,1) designs, mainly for t=2, admitting groups of automorphisms with sufficiently strong symmetry properties. However, despite the finite simple group classification, for Steiner t-designs with t>2 most of these characterizations have remained long-standing challenging problems. Especially, the determination of all flag-transitive Steiner t-designs with 3≤t≤6 is of particular interest and has been open for about 40 years (cf. Delandtsheer (Geom. Dedicata 41, p. 147, 1992 and Handbook of Incidence Geometry, Elsevier Science, Amsterdam, 1995, p. 273), but presumably dating back to 1965). The present paper continues the author’s work (see Huber (J. Comb. Theory Ser. A 94, 180–190, 2001; Adv. Geom. 5, 195–221, 2005; J. Algebr. Comb., 2007, to appear)) of classifying all flag-transitive Steiner 3-designs and 4-designs. We give a complete classification of all flag-transitive Steiner 5-designs and prove furthermore that there are no non-trivial flag-transitive Steiner 6-designs. Both results rely on the classification of the finite 3-homogeneous permutation groups. Moreover, we survey some of the most general results on highly symmetric Steiner t-designs.      

Some t-Homogeneous Sets of Permutations

Perpendicular Arrays are orderedcombinatorial structures, which recently have found applicationsin cryptography. A fundamental construction uses as ingredientscombinatorial designs and uniformly t-homogeneoussets of permutations. We study the latter type of objects. Thesemay also be viewed as generalizations of t-homogeneousgroups of permutations. Several construction techniques are given.Here we concentrate on the optimal case, where the number ofpermutations attains the lower bound. We obtain several new optimalsuch sets of permutations. Each example allows the constructionof infinite families of perpendicular arrays.     

Regular symmetric groups of boolean functions

We show that with the exception of four known cases: C₃, C₄, C₅, and , all regular permutation groups can be represented as symmetric groups of boolean functions. This solves the problem posed by A. Kisielewicz in the paper [A. Kisielewicz, Symmetry groups of boolean functions and constructions of permutation groups, J. Algebra 199 (1998) 379-403]. A slight extension of our proof yields the same result for semiregular groups.     

关于群类的Sylow性质

群类理论是在有限可解群研究工作的基础上发展起来的,但近年来对有限群论的许多方面都起到越来越大的作用.在考察群类性质时,注意到一个Fitting类(?)在可解群G中的(?)内射子具有Sylow子群所具有的某些性质,并且关于Sylow定理中(Sy13),证明了对于群的本原子群,成立更强的结论.     

Disjointness of Some Types of Extensions of Topological Transformation Semigroups

We extend (with some generalizations) Bronshtein's theorems about the disjointness of F-, PE-, V-extensions of minimal topological transformation groups.     

On the Structure of the Augmentation Quotient Group for Some Non-abelian p-groups

In this paper,we study the basis of augmentation ideals and the quotient groups of finite non-abelian p-group which has a cyclic subgroup of index p,where p is an odd prime,and k is greater than or equal to 3.A concrete basis for the augmentation ideal is obtained and then the structure of its quotient groups can be determined.     

血液二次分组化验最佳分组规律

研究了血液的二次分组化验最佳分组问题,运用数学分析方法找出了二次分组化验最佳分组规律.     

Johnson法则在成组加工排序中的推广

成组技术（Group Technology）是把工件分组进行加工,以提高生产效率的一种生产组织方法,本文把两台机器同序作业（同顺序流水作业）排序问题F2│perm│C_(max)的John-son法则推广到成组加工上,提出确定组与组之间顺序的最优法则,给出了这个问题成组加工的最优排法,并分析算法的计算复杂性。