dc.contributor |
Centre de Recerca Matemàtica |
dc.contributor.author |
Ciobanu, Laura |
dc.date.accessioned |
2006-01-10T08:38:54Z |
dc.date.available |
2006-01-10T08:38:54Z |
dc.date.issued |
2005-10 |
dc.identifier.uri |
http://hdl.handle.net/2072/1395 |
dc.format.extent |
357207 bytes |
dc.format.mimetype |
application/pdf |
dc.language.iso |
eng |
dc.publisher |
Centre de Recerca Matemàtica |
dc.relation.ispartofseries |
Prepublicacions del Centre de Recerca Matemàtica;655 |
dc.rights |
Aquest document està subjecte a una llicència d'ús de Creative Commons, amb la qual es permet copiar, distribuir i comunicar públicament l'obra sempre que se'n citin l'autor original, la universitat i el centre i no se'n faci cap ús comercial ni obra derivada, tal com queda estipulat en la llicència d'ús (http://creativecommons.org/licenses/by-nc-nd/2.5/es/) |
dc.subject |
Grups lliures |
dc.subject |
Endomorfismes (Teoria de grups) |
dc.title |
Polynomial-time complexity for instances of the endomorphism problem in free groups |
dc.type |
info:eu-repo/semantics/preprint |
dc.description.abstract |
We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F, there is an endomorphism Φ of F sending W to U.
This work analyzes an approach due to C. Edmunds and improved by C. Sims. Here we prove that the approach provides an efficient algorithm for solving the endomorphism problem when W is a two-
generator word. We show that when W is a two-generator word this algorithm solves the problem in time polynomial in the length of U.
This result gives a polynomial-time algorithm for solving, in free groups, two-variable equations in which all the variables occur on one side of the equality and all the constants on the other side. |