Constructing and Deconstructing Latin Trades

This paper discusses existence results for latin trades and provides a Glueing Construction which is subsequently used to construct all latin trades of finite order greater than three.

Some challenging group presentations

We study some challenging presentations which arise as groups of deficiency zero. In four cases we settle finiteness: we show that two presentations are for finite groups while two are fur infinite groups. Thus we answer three explicit questions in the literature and we provide the first published deficiency zero presentation for a group with derived length seven. The tools we use are coset enumeration and Knuth-Bendix rewriting, which are well-established as methods for proving finiteness or otherwise of a finitely presented group. We briefly comment on their capabilities and compare their performance.

Efficient simple groups

We prove that the simple group L-3(5) which has order 372000 is efficient by providing an efficient presentation for it. This leaves one simple group with order less than one million, S-4(4) which has order 979200, whose efficiency or otherwise remains to be determined.

Further decompositions of complete tripartite graphs into 5-cycles

Let K(r,s,t) denote the complete tripartite graph with partite sets of sizes r, s and t, where r less than or equal to s less than or equal to t. Necessary and sufficient conditions are given for decomposability of K(r, s, t) into 5-cycles whenever r, s and t are all even. This extends work done by Mahmoodian and Mirza-khani (Decomposition of complete tripartite graphs into 5-cycles, in: Combinatorics Advances, Kluwer Academic Publishers, Netherlands, 1995, pp. 235-241) and Cavenagh and Billington. (C) 2002 Elsevier Science B.V. All rights reserved.

Breadth-first search and the Andrews-Curtis conjecture

Andrews and Curtis conjectured in 1965 that every balanced presentation of the trivial group can be transformed into a standard presentation by a finite sequence of elementary transformations. Recent computational work by Miasnikov and Myasnikov on this problem has been based on genetic algorithms. We show that a computational attack based on a breadth-first search of the tree of equivalent presentations is also viable, and seems to outperform that based on genetic algorithms. It allows us to extract shorter proofs (in some cases, provably shortest) and to consider the length thirteen case for two generators. We prove that, up to equivalence, there is a unique minimum potential counterexample.

Irreducible cyclic presentations of the trivial group

We produce families of irreducible cyclic presentations of the trivial group. These families comprehensively answer questions about such presentations asked by Dunwoody and by Edjvet, Hammond, and Thomas. Our theorems are purely theoretical, but their derivation is based on practical computations. We explain how we chose the computations and how we deduced the theorems.

Experimenting with infinite groups, I

A group is termed parafree if it is residually nilpotent and has the same nilpotent quotients as a given free group. Since free groups are residually nilpotent, they are parafree. Nonfree parafree groups abound and they all have many properties in common with free groups. Finitely presented parafree groups have solvable word problems, but little is known about the conjugacy and isomorphism problems. The conjugacy problem plays an important part in determining whether an automorphism is inner, which we term the inner automorphism problem. We will attack these and other problems about parafree groups experimentally, in a series of papers, of which this is the first and which is concerned with the isomorphism problem. The approach that we take here is to distinguish some parafree groups by computing the number of epimorphisms onto selected finite groups. It turns out, rather unexpectedly, that an understanding of the quotients of certain groups leads to some new results about equations in free and relatively free groups. We touch on this only lightly here but will discuss this in more depth in a future paper.

On the efficiency of some finite groups

We describe a new technique for finding efficient presentations for finite groups. We use it to answer three previously unresolved questions about the efficiency of group and semigroup presentations.

On decomposition of sub-linearised polynomials

We give a detailed exposition of the theory of decompositions of linearised polynomials, using a well-known connection with skew-polynomial rings with zero derivative. It is known that there is a one-to-one correspondence between decompositions of linearised polynomials and sub-linearised polynomials. This correspondence leads to a formula for the number of indecomposable sub-linearised polynomials of given degree over a finite field. We also show how to extend existing factorisation algorithms over skew-polynomial rings to decompose sub-linearised polynomials without asymptotic cost.

4-Engel groups are locally nilpotent

Questions about nilpotency of groups satisfying Engel conditions have been considered since 1936, when Zorn proved that finite Engel groups are nilpotent. We prove that 4-Engel groups are locally nilpotent. Our proof makes substantial use of both hand and machine calculations.