Results 1 
8 of
8
Finite permutation groups and finite simple groups
 Bull. London Math. Soc
, 1981
"... In the past two decades, there have been farreaching developments in the problem of determining all finite nonabelian simple groups—so much so, that many people now believe that the solution to the problem is imminent. And now, as I correct these proofs in October 1980, the solution has just been ..."
Abstract

Cited by 94 (3 self)
 Add to MetaCart
In the past two decades, there have been farreaching developments in the problem of determining all finite nonabelian simple groups—so much so, that many people now believe that the solution to the problem is imminent. And now, as I correct these proofs in October 1980, the solution has just been announced. Of
The word problem for latticeordered groups
 Trans. Amer. Math. Soc
, 1983
"... To. W. W. Boone on the occasion of his 60 th birthday ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
To. W. W. Boone on the occasion of his 60 th birthday
A faithful representation of the singular braid monoid on three strands. in: Knots in Hellas ’98
 Delphi)), Ser. Knots Everything
, 1980
"... We show that a certain linear representation of the singular braid monoid SB3 is faithful. Furthermore we will give a second group theoretically motivated solution to the word problem in SB3. 1 ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We show that a certain linear representation of the singular braid monoid SB3 is faithful. Furthermore we will give a second group theoretically motivated solution to the word problem in SB3. 1
The word problem for the singular braid monoid
, 1999
"... We give a solution to the word problem for the singular braid monoid SBn. The complexity of the algorithm is quadratic in the product of the word length and the number of the singular generators in the word. Furthermore we algebraically reprove a result of Fenn, Keyman and Rourke that the monoid emb ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We give a solution to the word problem for the singular braid monoid SBn. The complexity of the algorithm is quadratic in the product of the word length and the number of the singular generators in the word. Furthermore we algebraically reprove a result of Fenn, Keyman and Rourke that the monoid embeds into a group and we compute the cohomological dimension of this group. 1
EFFICIENT COMPUTATION IN GROUPS AND SIMPLICIAL COMPLEXES BY
"... Abstract. Using HNN extensions of the BooneBritton group, a group E is obtained which simulates Turing machine computation in linear space and cubic time. Space in E is measured by the length of words, and time by the number of substitutions of defining relators and conjugations by generators requi ..."
Abstract
 Add to MetaCart
Abstract. Using HNN extensions of the BooneBritton group, a group E is obtained which simulates Turing machine computation in linear space and cubic time. Space in E is measured by the length of words, and time by the number of substitutions of defining relators and conjugations by generators required to convert one word to another. The space bound is used to derive a PSPACEcomplete problem for a topological model of computation previously used to characterize NPcompleteness and REcompleteness. Introduction. The ability of mathematical systems to simulate computation has often been used to prove unsolvability results. The first, and most instructive, example was Post's simulation of Turing machines by finitely presented semigroups [10]. For each deterministic Turing machine M, Post constructs a semigroup T(M) on generators we shall call qa, sb, where a and A range over certain finite sets. An
GröbnerShirshov bases for some onerelator groups
, 2008
"... In this paper, we prove that twogenerator onerelator groups with depth less than or equal to 3 can be effectively embedded into a tower of HNNextensions in which each group has the effective standard normal form. We give an example to show how to deal with some general cases for onerelator group ..."
Abstract
 Add to MetaCart
In this paper, we prove that twogenerator onerelator groups with depth less than or equal to 3 can be effectively embedded into a tower of HNNextensions in which each group has the effective standard normal form. We give an example to show how to deal with some general cases for onerelator groups. By using the Magnus method and CompositionDiamond Lemma, we reprove the G. Higman, B. H. Neumann and H. Neumann’s embedding theorem.
Groups Geom. Dyn. 1 (2007), 1–20 Groups, Geometry, and Dynamics © European Mathematical Society
"... The isomorphism problem for residually torsionfree nilpotent groups ..."