4 citations · 4 across the 6 of their papers we have counts for
6 papers · 1 filter
Effective JSJ Decompositions
Olga Kharlampovich, Alexei Myasnikov
In this paper we describe an elimination process which is a deterministic rewriting procedure that on each elementary step transforms one system of equations over free groups into…
Balanced presentations of the trivial group on two generators and the Andrews-Curtis conjecture
Alexei D. Miasnikov, Alexei G. Myasnikov
The Andrews-Curtis conjecture states that every balanced presentation of the trivial group can be reduced to the standard one by a sequence of the elementary Nielsen transformation…
Whitehead method and Genetic Algorithms
Alexei D. Miasnikov, Alexei G. Myasnikov
In this paper we discuss a genetic version (GWA) of the Whitehead's algorithm, which is one of the basic algorithms in combinatorial group theory. It turns out that GWA is surprisi…
On the Andrews-Curtis equivalence
Alexei D. Myasnikov, Alexei G. Myasnikov, Vladimir Shpilrain
The Andrews-Curtis conjecture claims that every balanced presentation of the trivial group can be reduced to the standard one by a sequence of ``elementary transformations" which a…
Foldings, graphs of groups and the membership problem
Ilya Kapovich, Richard Weidmann, Alexei Myasnikov
We introduce a combinatorial version of Stallings-Bestvina-Feighn-Dunwoody folding sequences. We then show how they are useful in analyzing the solvability of the uniform subgroup…
On the Hanna Neumann Conjecture
Toshiaki Jitsukawa, Bilal Khan, Alexei G. Myasnikov
The Hanna Neumann conjecture states that if F is a free group, then for all nontrivial finitely generated subgroups H,K <= F, rank(H intersect K) - 1 <= [rank(H)-1] [rank(K)-1]. Wh…