dc.contributor |
Centre de Recerca Matemàtica |
dc.contributor.author |
Cleary, Sean |
dc.contributor.author |
Taback, Jennifer |
dc.date.accessioned |
2006-02-03T12:43:03Z |
dc.date.available |
2006-02-03T12:43:03Z |
dc.date.issued |
2005-06 |
dc.identifier.uri |
http://hdl.handle.net/2072/1489 |
dc.format.extent |
244793 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;637 |
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 |
Arbres (Teoria dels grafs) |
dc.title |
Bounding right-arm rotation distances |
dc.type |
info:eu-repo/semantics/preprint |
dc.description.abstract |
Rotation distance quantifies the difference in shape between two rooted binary trees of the same size by counting the minimum number of elementary changes needed to transform one tree to the other. We describe several types of rotation distance, and provide upper bounds on distances between trees with a fixed number of nodes with respect to each type. These bounds are obtained by relating each restricted rotation distance to the word length of elements of Thompson's group F with respect to different generating sets, including both finite and infinite generating sets. |