2 citations · 2 across the 3 of their papers we have counts for
5 papers
Low-complexity computations for nilpotent subgroup problems
Jeremy Macdonald, Alexei Miasnikov, Denis Ovchinnikov
We solve the following algorithmic problems using TC0 circuits, or in logspace and quasilinear time, uniformly in the class of nilpotent groups with bounded nilpotency class and ra…
Logspace and compressed-word computations in nilpotent groups
Jeremy Macdonald, Alexei Myasnikov, Andrey Nikolaev +1
For finitely generated nilpotent groups, we employ Mal'cev coordinates to solve several classical algorithmic problems efficiently. Computation of normal forms, the membership prob…
Effective coherence of groups discriminated by a locally quasi-convex hyperbolic group
Inna Bumagin, Jeremy Macdonald
We prove that every finitely generated group discriminated by a locally quasi-convex torsion-free hyperbolic group is effectively coherent: that is, presentations for finit…
Effective embedding of residually hyperbolic groups into direct products of extensions of centralizers
Olga Kharlampovich, Jeremy Macdonald
For any torsion-free hyperbolic group and any group that is fully residually , we construct algorithmically a finite collection of homomorphisms from to groups obtai…
Compressed words and automorphisms in fully residually free groups
Jeremy Macdonald
We show that the compressed word problem in a finitely-generated fully residually free group (F -group) is decidable in polynomial time, and use the result to show that the word pr…