A conjecture of Boone and Higman from the 1970's asserts that a finitely generated group G has solvable word problem if and only if G can be embedded into a finitely presented simple group. We comment on the history of this conjecture and survey recent results that establish the conjecture for many large classes of interesting groups
Funder: University of LincolnAbstract: Let w be a word in k variables. For a finite nilpotent group ...
If $\langle X\vert\kappa\sb{\rm CR}\rangle$ is a presentation of a completely regular semigroup, the...
This work treats word problems of finitely generated groups and variations thereof, such as word pro...
The Boone--Higman conjecture is that every recursively presented group with solvable word problem em...
The 1973 Boone-Higman conjecture predicts that every finitely generated group with solvable word pro...
Every finitely presented group G has a quotient group with solvable word problem – namely the trivia...
For every finitely generated recursively presented group G we construct a finitely presented group H...
The word problem of a finitely generated group is a fundamental notion in group theory; it can be de...
For any group G and generating set X we shall be primarily concerned with three sets of words over X...
For any group G and generating set X we shall be primarily concerned with three sets of words over X...
Diese Masterarbeit behandelt das Wortproblem für Gruppen; in drei einleitenden Kapiteln werden der R...
AbstractWe construct infinite finitely presented simple groups that have subgroups isomorphic to Gri...
A group whose co-word problem is a context free language is called co . Lehnert's conjecture states ...
This paper is a self-contained proof of the unsolvability/undecidability of the word problem for gro...
For finite group presentations, the word problem is solvable if and only if the Dehn function is com...
Funder: University of LincolnAbstract: Let w be a word in k variables. For a finite nilpotent group ...
If $\langle X\vert\kappa\sb{\rm CR}\rangle$ is a presentation of a completely regular semigroup, the...
This work treats word problems of finitely generated groups and variations thereof, such as word pro...
The Boone--Higman conjecture is that every recursively presented group with solvable word problem em...
The 1973 Boone-Higman conjecture predicts that every finitely generated group with solvable word pro...
Every finitely presented group G has a quotient group with solvable word problem – namely the trivia...
For every finitely generated recursively presented group G we construct a finitely presented group H...
The word problem of a finitely generated group is a fundamental notion in group theory; it can be de...
For any group G and generating set X we shall be primarily concerned with three sets of words over X...
For any group G and generating set X we shall be primarily concerned with three sets of words over X...
Diese Masterarbeit behandelt das Wortproblem für Gruppen; in drei einleitenden Kapiteln werden der R...
AbstractWe construct infinite finitely presented simple groups that have subgroups isomorphic to Gri...
A group whose co-word problem is a context free language is called co . Lehnert's conjecture states ...
This paper is a self-contained proof of the unsolvability/undecidability of the word problem for gro...
For finite group presentations, the word problem is solvable if and only if the Dehn function is com...
Funder: University of LincolnAbstract: Let w be a word in k variables. For a finite nilpotent group ...
If $\langle X\vert\kappa\sb{\rm CR}\rangle$ is a presentation of a completely regular semigroup, the...
This work treats word problems of finitely generated groups and variations thereof, such as word pro...
Add to ORKG