AbstractWe investigate the fundamental group of Griffithsʼ space, and the first singular homology group of this space and of the Hawaiian Earring by using (countable) reduced tame words. We prove that two such words represent the same element in the corresponding group if and only if they can be carried to the same tame word by a finite number of word transformations from a given list. This enables us to construct elements with special properties in these groups. By applying this method we prove that the two homology groups contain uncountably many different elements that can be represented by infinite concatenations of countably many commutators of loops. As another application we give a short proof that these homology groups contain the d...
Let w be a group word. It is conjectured that if w has only countably many values in a profinite gro...
This work treats word problems of finitely generated groups and variations thereof, such as word pro...
This work treats word problems of finitely generated groups and variations thereof, such as word pro...
AbstractWe investigate the fundamental group of Griffithsʼ space, and the first singular homology gr...
We investigate the fundamental group of Griffiths ’ space, and the first singular homology group of ...
Every finitely presented group G has a quotient group with solvable word problem – namely the trivia...
AbstractIn this paper we study the combinatorial structure of the Hawaiian earring group, by showing...
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...
The word problem of a finitely generated group is a fundamental notion in group theory; it can be de...
AbstractIn this paper we study the combinatorial structure of the Hawaiian earring group, by showing...
Abstract. Let X be a metrizable one-dimensional continuum. In the present paper we describe the fund...
Diese Masterarbeit behandelt das Wortproblem für Gruppen; in drei einleitenden Kapiteln werden der R...
Let w be a group word. It is conjectured that if w has only countably many values in a profinite gro...
Let w be a group word. It is conjectured that if w has only countably many values in a profinite gro...
Let w be a group word. It is conjectured that if w has only countably many values in a profinite gro...
This work treats word problems of finitely generated groups and variations thereof, such as word pro...
This work treats word problems of finitely generated groups and variations thereof, such as word pro...
AbstractWe investigate the fundamental group of Griffithsʼ space, and the first singular homology gr...
We investigate the fundamental group of Griffiths ’ space, and the first singular homology group of ...
Every finitely presented group G has a quotient group with solvable word problem – namely the trivia...
AbstractIn this paper we study the combinatorial structure of the Hawaiian earring group, by showing...
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...
The word problem of a finitely generated group is a fundamental notion in group theory; it can be de...
AbstractIn this paper we study the combinatorial structure of the Hawaiian earring group, by showing...
Abstract. Let X be a metrizable one-dimensional continuum. In the present paper we describe the fund...
Diese Masterarbeit behandelt das Wortproblem für Gruppen; in drei einleitenden Kapiteln werden der R...
Let w be a group word. It is conjectured that if w has only countably many values in a profinite gro...
Let w be a group word. It is conjectured that if w has only countably many values in a profinite gro...
Let w be a group word. It is conjectured that if w has only countably many values in a profinite gro...
This work treats word problems of finitely generated groups and variations thereof, such as word pro...
This work treats word problems of finitely generated groups and variations thereof, such as word pro...