9 citations · 13 across the 2 of their papers we have counts for
2 papers
math.GR2005★ 4 cited
Navigating in the Cayley graphs of SL_N(Z) and SL_N(F_p)
T. R. Riley
We give a non-deterministic algorithm that expresses elements of SL_N(Z), for N > 2, as words in a finite set of generators, with the length of these words at most a constant times…
math.GR2000★ 9 cited
Filling Length in Finitely Presentable Groups
S. Gersten, T. Riley
Filling length measures the length of the contracting closed loops in a null-homotopy. The filling length function of Gromov for a finitely presented group measures the filling len…