Mostrar el registro sencillo del documento
Derivation- bounded groups
dc.rights.license | Atribución-NoComercial 4.0 Internacional |
dc.contributor.author | Madlener, K. |
dc.contributor.author | Otto, F. |
dc.date.accessioned | 2019-06-29T08:05:03Z |
dc.date.available | 2019-06-29T08:05:03Z |
dc.date.issued | 1985 |
dc.identifier.uri | https://repositorio.unal.edu.co/handle/unal/48769 |
dc.description.abstract | For some problems which are defined by combinatorial properties good complexity bounds cannot be found because the combinatorial point of view restricts the set of solution algorithms. In this paper we present a phenomenon of this type with the classical word problem for finitely presented groups. A presentation of a group is called En-derivation-bounded (En-d.b.), if a function kϵEn exists which bounds the derivations of the words defining the unit element. For En-d.b. presentations a pure combinatorial En-algorithm for solving the word problem exists. It is proved that the property of being En-d.b. is an invariant of finite presentations, but that the degree of complexity of the pure combinatorial algorithm may be as far as posible from the degree of complexity of the word problem itself. |
dc.format.mimetype | application/pdf |
dc.language.iso | spa |
dc.publisher | Universidad Nacuional de Colombia; Sociedad Colombiana de matemáticas |
dc.relation | http://revistas.unal.edu.co/index.php/recolma/article/view/32595 |
dc.relation.ispartof | Universidad Nacional de Colombia Revistas electrónicas UN Revista Colombiana de Matemáticas |
dc.relation.ispartof | Revista Colombiana de Matemáticas |
dc.relation.ispartofseries | Revista Colombiana de Matemáticas; Vol. 19, núm. 1-2 (1985); 131-161 2357-4100 0034-7426 |
dc.rights | Derechos reservados - Universidad Nacional de Colombia |
dc.rights.uri | http://creativecommons.org/licenses/by-nc/4.0/ |
dc.title | Derivation- bounded groups |
dc.type | Artículo de revista |
dc.type.driver | info:eu-repo/semantics/article |
dc.type.version | info:eu-repo/semantics/publishedVersion |
dc.identifier.eprints | http://bdigital.unal.edu.co/42226/ |
dc.relation.references | Madlener, K. and Otto, F. (1985) Derivation- bounded groups. Revista Colombiana de Matemáticas; Vol. 19, núm. 1-2 (1985); 131-161 2357-4100 0034-7426 . |
dc.rights.accessrights | info:eu-repo/semantics/openAccess |
dc.subject.proposal | Problems |
dc.subject.proposal | combinatorial properties |
dc.subject.proposal | limits |
dc.subject.proposal | set of algorithms |
dc.subject.proposal | groups |
dc.type.coar | http://purl.org/coar/resource_type/c_6501 |
dc.type.coarversion | http://purl.org/coar/version/c_970fb48d4fbd8a85 |
dc.type.content | Text |
dc.type.redcol | http://purl.org/redcol/resource_type/ART |
oaire.accessrights | http://purl.org/coar/access_right/c_abf2 |
Archivos en el documento
Este documento aparece en la(s) siguiente(s) colección(ones)
![Atribución-NoComercial 4.0 Internacional](/themes/Mirage2//images/creativecommons/cc-generic.png)