Divisibility Theory and Complexity of Algorithms in Free Partially Commutative Groups
arXiv:math/0512401
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.
43 pages, Appendix included