52 citations · 293 across the 47 of their papers we have counts for
6 papers · 1 filter
Random sampling of trivials words in finitely presented groups
M. Elder, A. Rechnitzer, E. J. Janse van Rensburg
We describe a novel algorithm for random sampling of freely reduced words equal to the identity in a finitely presented group. The algorithm is based on Metropolis Monte Carlo samp…
Simple groups of automorphisms of trees determined by their actions on finite subtrees
Christopher C. Banks, Murray Elder, George A. Willis
We introduce the notion of the -closure of a group of automorphisms of a locally finite tree, and give several examples of the construction. We show that the -closure satisfi…
Some non-contracting automata groups
Nick Davis, Murray Elder, Lawrence Reeves
We add to the classification of groups generated by 3-state automata over a 2 letter alphabet given by Bondarenko et al., by showing that a number of the groups in the classificati…
Logspace computations for Garside groups of spindle type
Murray Elder, Arkadius Kalka
M. Picantin introduced the notion of Garside groups of spindle type, generalizing the 3-strand braid group. We show that, for linear Garside groups of spindle type, a normal form a…
The cogrowth series for is D-finite
M. Elder, A. Rechnitzer, E. J. Janse van Rensburg +1
We compute the cogrowth series for Baumslag-Solitar groups , which we show to be D-finite. It follows that their cogrowth rates are alg…
Totally disconnected groups from Baumslag-Solitar groups
Murray Elder, George Willis
For each Baumslag-Solitar group BS(m,n) (m,n nonzero integers), a totally disconnected, locally compact group, G_{m,n}, is constructed so that BS(m,n) is identified with a dense su…