论文信息 - One-Side Nielsen Transformations in Free Groups

One-Side Nielsen Transformations in Free Groups

We study a graph related to the Andrews—Curtis graph. The vertices are pairs of elements of a free group, and two vertices are adjacent if they can be obtained from one another by a left Nielsen transformation, that is, for each two words u, v the pair (u, v) is adjacent to (vu, v), (v‑1u, v), (u, uv), and (u, u‑1v). We study connected components of the graph and describe the shortest pairs in all components. Hence, we find a linear-time algorithm for checking whether two pairs belong to the same connected component of the graph.

Alexei Vernitski

[1] George Havas,et al. Breadth-First Search and the Andrews-Curtis Conjecture , 2003, Int. J. Algebra Comput..

[2] R. Lyndon,et al. Combinatorial Group Theory , 1977 .

[3] Alexei G. Myasnikov,et al. Balanced presentations of the trivial group on two generators and the Andrews-Curtis conjecture , 2003, ArXiv.

[4] Alexandre V. Borovik,et al. The Andrews-Curtis Conjecture and Black Box Groups , 2003, Int. J. Algebra Comput..

[5] Athanase Papadopoulos,et al. Géométrie et théorie des groupes , 1990 .

[6] A. Borovik. Centralisers of Involutions in Black Box Groups , 2001, math/0110233.

[7] J. J. Andrews,et al. Free groups and handlebodies , 1965 .