50 citations · 70 across the 14 of their papers we have counts for
18 papers
Andrews-Curtis groups
Robert H. Gilman, Alexei G. Myasnikov
For any group and integer the Andrews-Curtis transformations act as a permutation group, termed the Andrews-Curtis group , on the subset …
Algorithmic Search in Group Theory
Robert H. Gilman
A method of random search based on Kolmogorov complexity is proposed and applied to two search problems in group theory. The method is provably effective but not practical, so the…
Groups whose word problems are not semilinear
Robert H. Gilman, Robert P. Kropholler, Saul Schleimer
Suppose that G is a finitely generated group and W is the formal language of words defining the identity in G. We prove that if G is a nilpotent group, the fundamental group of a f…
A Finitely presented group whose word problem has sampleable hard instances
Robert H Gilman
Hard instances of natural computational problems are often elusive. In this note we present an example of a natural decision problem, the word problem for a certain finitely presen…
Generalized Small Cancellation Presentations for Automatic Groups
Robert H. Gilman
By a result of Gersten and Short finite presentations satisfying the usual non-metric small cancellation conditions present biautomatic groups. We show that in the case in which al…
A characterisation of virtually free groups
Robert H. Gilman, S. Hermiller, Derek F. Holt +1
We prove that a finitely generated group is virtually free if and only if there exists a generating set for and such that all -locally geodesic words with respec…