Divisibility Theory and Complexity of Algorithms in Free Partially Commutative Groups
Group Theory
2007-05-23 v2
Abstract
The original version of the paper was published in Contemporary Mathematics 378 ``Groups, Languages, Algorithms''; 2005, pp. 319-348. This is a modified version with Appendix that holds a corrected formulation of Proposition 4.1.
Cite
@article{arxiv.math/0512401,
title = {Divisibility Theory and Complexity of Algorithms in Free Partially Commutative Groups},
author = {E. S. Esyp and I. V. Kazachkov and V. N. Remeslennikov},
journal= {arXiv preprint arXiv:math/0512401},
year = {2007}
}
Comments
43 pages, Appendix included