Clusters, currents and Whitehead's algorithm

Simple item page
dc.creatorKapovich, Ilya
dc.date2005-11-19
dc.date2006-09-12
dc.date.accessioned2026-07-07T06:51:27Z
dc.date.available2026-07-07T06:51:27Z
dc.descriptionUsing geodesic currents, we provide a theoretical justification for some of the experimental results regarding the behavior of Whitehead's algorithm on non-minimal inputs, that were obtained by Haralick, Miasnikov and Myasnikov via pattern recognition methods. In particular we prove that the images of "random" elements of a free group $F$ under the automorphisms of $F$ form "clusters" that share similar normalized Whitehead graphs and similar behavior with respect to Whitehead's algorithm.
dc.descriptionUpdated version, to appear in "Experimental Mathematics"
dc.identifierhttps://arxiv.org/abs/math/0511478
dc.identifierhttp://arxiv.org/abs/math/0511478
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/104993
dc.subjectGroup Theory
dc.subjectGeometric Topology
dc.subject20F
dc.titleClusters, currents and Whitehead's algorithm
dc.typetext

Files

Collections

arXiv