We prove that the groups presented by finite convergent monadic rewriting systems with generators of finite order are exactly the free products of finitely many finite groups, thereby confirming Gilman’s Conjecture in a special case. We also prove that the finite cyclic groups of order at least three are the only finite groups admitting a presentation by more than one finite convergent monadic rewriting system (up to relabeling), and these admit presentation by exactly two such rewriting systems
AbstractWe present a purely combinatorial approach to the question of whether or not a finitely pres...
In 1987, Craig Squier proved that, if a monoid can be presented by a finite convergent string rewrit...
Abstract. We show that if Γ is a finitely presented metabelian group, then the “untwisted ” fibre pr...
We prove that the groups presented by finite convergent monadic rewriting systems with generators of...
We prove a conjecture made by Gilman in 1984 that the groups presented by finite, monadic, confluent...
AbstractIt is shown that for the presentation (a, b; abbaab = λ) of the Jantzen monoid J no finite c...
AbstractIt is investigated as to how far the various decidability results for finite, monadic, and c...
AbstractFinite string-rewriting systems can be used to present monoids and groups. In general, these...
For any group G and generating set X we shall be primarily concerned with three sets of words over X...
AbstractWe show that if Γ is a finitely presented metabelian group, then the “untwisted” fibre produ...
AbstractThe homological finiteness propertyFP3and the combinatorial property of having finite deriva...
AbstractIn this paper we survey some surprising connections between group theory, the theory of auto...
For any group G and generating set X we shall be primarily concerned with three sets of words over X...
Let S be a monoid and let T be a submonoid of finite index in S. The main results in this paper stat...
We show that if Γ is a finitely presented metabelian group, then the "untwisted" fibre product or pu...
AbstractWe present a purely combinatorial approach to the question of whether or not a finitely pres...
In 1987, Craig Squier proved that, if a monoid can be presented by a finite convergent string rewrit...
Abstract. We show that if Γ is a finitely presented metabelian group, then the “untwisted ” fibre pr...
We prove that the groups presented by finite convergent monadic rewriting systems with generators of...
We prove a conjecture made by Gilman in 1984 that the groups presented by finite, monadic, confluent...
AbstractIt is shown that for the presentation (a, b; abbaab = λ) of the Jantzen monoid J no finite c...
AbstractIt is investigated as to how far the various decidability results for finite, monadic, and c...
AbstractFinite string-rewriting systems can be used to present monoids and groups. In general, these...
For any group G and generating set X we shall be primarily concerned with three sets of words over X...
AbstractWe show that if Γ is a finitely presented metabelian group, then the “untwisted” fibre produ...
AbstractThe homological finiteness propertyFP3and the combinatorial property of having finite deriva...
AbstractIn this paper we survey some surprising connections between group theory, the theory of auto...
For any group G and generating set X we shall be primarily concerned with three sets of words over X...
Let S be a monoid and let T be a submonoid of finite index in S. The main results in this paper stat...
We show that if Γ is a finitely presented metabelian group, then the "untwisted" fibre product or pu...
AbstractWe present a purely combinatorial approach to the question of whether or not a finitely pres...
In 1987, Craig Squier proved that, if a monoid can be presented by a finite convergent string rewrit...
Abstract. We show that if Γ is a finitely presented metabelian group, then the “untwisted ” fibre pr...