Results 1  10
of
12
ON THE FUNDAMENTAL GROUPS OF ONE–DIMENSIONAL SPACES
, 1998
"... We study the fundamental group of one–dimensional spaces. Among the results we prove are that the fundamental group of a second countable, connected, locally path connected, one–dimensional metric space is free if and only if it is countable if and only if the space has a universal cover and that t ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
We study the fundamental group of one–dimensional spaces. Among the results we prove are that the fundamental group of a second countable, connected, locally path connected, one–dimensional metric space is free if and only if it is countable if and only if the space has a universal cover and that the fundamental group of a compact, one–dimensional, connected metric space embeds in an inverse limit of finitely generated free groups.
STATISTICAL PROPERTIES OF THOMPSON’S GROUP AND RANDOM PSEUDO MANIFOLDS
, 2005
"... of a dissertation submitted by ..."
Construction of Combinatorial Objects
, 1995
"... Isomorphism problems often can be solved by determining orbits of a group acting on the set of all objects to be classified. The paper centers around algorithms for this topic and shows how to base them on the same idea, the homomorphism principle. Especially it is shown that forming Sims chains, u ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Isomorphism problems often can be solved by determining orbits of a group acting on the set of all objects to be classified. The paper centers around algorithms for this topic and shows how to base them on the same idea, the homomorphism principle. Especially it is shown that forming Sims chains, using an algorithmic version of Burnside's table of marks, computing double coset representatives, and computing Sylow subgroups of automorphism groups can be explained in this way. The exposition is based on graph theoretic concepts to give an easy explanation of data structures for group actions.
Geometries for the group PSL(3, 4)
, 1999
"... We classify all firm, residually connected coset geometries, on which the group PSL(3; 4) acts as a flagtransitive automorphism group fulfilling the residually weakly primitive condition: The stabilizer of any flag F acts primitively on the elements of some type in the residue F . We demand also ..."
Abstract
 Add to MetaCart
We classify all firm, residually connected coset geometries, on which the group PSL(3; 4) acts as a flagtransitive automorphism group fulfilling the residually weakly primitive condition: The stabilizer of any flag F acts primitively on the elements of some type in the residue F . We demand also that every residue of rank two satisfies the intersection property. We give geometric constructions for all geometries obtained.
The Rank 2 . . . Suzuki Groups Sz(q)
, 1998
"... We determine all firm and residually connected rank 2 geometries on which a Suzuki simple group Sz(q) acts flagtransitively and residually weakly primitively. ..."
Abstract
 Add to MetaCart
We determine all firm and residually connected rank 2 geometries on which a Suzuki simple group Sz(q) acts flagtransitively and residually weakly primitively.
IN SEARCH OF 4 (12, 6, 4) DESIGNS: PART III D.R.Breach,
"... A 4(12, 6, 4) design that is not also a 5(12, 6, 1) design must have at least one pair of blocks with five points in common. It is shown that there are just nine nonisomorphic such designs; so, including the 5(12, 6, 1) design, there are ten 4(12, 6, 4) designs. These designs are characterised ..."
Abstract
 Add to MetaCart
A 4(12, 6, 4) design that is not also a 5(12, 6, 1) design must have at least one pair of blocks with five points in common. It is shown that there are just nine nonisomorphic such designs; so, including the 5(12, 6, 1) design, there are ten 4(12, 6, 4) designs. These designs are characterised by the orders of their automorphism groups and they all contain a 4(11, 5, 1) design. 1.
Modelling algebraic structures with Prolog (Extended abstract)
"... This paper presents a novel technique of using Prolog with never instantiated variables to manipulate a range of algebraic structures. The paper argues that Prolog is a powerful and underrated tool for use in computational number theory. A detailed example is presented in this extended abstract, and ..."
Abstract
 Add to MetaCart
This paper presents a novel technique of using Prolog with never instantiated variables to manipulate a range of algebraic structures. The paper argues that Prolog is a powerful and underrated tool for use in computational number theory. A detailed example is presented in this extended abstract, and several in the full paper, showing the advantages of using this technique. The detailed example is an application of higher dimensional category theory which has been used for solving problems in this area. 1 Introduction Among the many problems dealt with in computational algebra two important classes of problems deal with enumerating algebraic structures with certain properties and manipulating or calculating with the elements of such structures. For particular algebraic structures very efficient solutions to these problems are known and such solutions are typically made available as parts of one or more of the large computational packages now available (which include for example Cayley ...
Standard generators for J_3
"... this paper we develop these ideas further, in the context of the simple group J 3 . This group was chosen firstly because it has an outer automorphism group of order 2, which introduces extra complications, and secondly because it is reasonably small (of order 50232960) so we can do quite a large nu ..."
Abstract
 Add to MetaCart
this paper we develop these ideas further, in the context of the simple group J 3 . This group was chosen firstly because it has an outer automorphism group of order 2, which introduces extra complications, and secondly because it is reasonably small (of order 50232960) so we can do quite a large number of calculations in the group. Our main aims at this stage are: 1. To pass from J 3 :2 to J 3 and (as far as possible) vice versa