Divisibility Theory and Complexity of Algorithms in Free Partially Commutative Groups

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Group Theory, 20E06; 20F05; 20F10

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/106274

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0512401
 http://arxiv.org/abs/math/0512401
 E.S. Esyp, I.V. Kazatchkov and V.N. Remeslennikov, {\em Divisibility Theory and Complexity of Algorithms for Free Partially Commutative Groups}, Contemporary Mathematics 378 ``Groups, Languages, Algorithms''; 2005, pp. 319-348

Collections

arXiv