A Generalized Balanced Pair Algorithm

Simple item page
dc.creatorMartensen, Brian F.
dc.date2003-09-11
dc.date.accessioned2026-07-07T05:01:03Z
dc.date.available2026-07-07T05:01:03Z
dc.descriptionWe present here a more general version of the balanced pair algorithm. This version works in the reducible case and terminates more often than the standard algorithm. We present examples to illustrate this point. Lastly, we discuss the features which lead to balanced pair algorithms not terminating and state several conjectures.
dc.descriptionLatex, 11 pages, no figures. Submitted to Topology Proceedings
dc.identifierhttps://arxiv.org/abs/math/0309194
dc.identifierhttp://arxiv.org/abs/math/0309194
dc.identifierTopology Proceedings Volume 28, No. 1, 2004
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/68540
dc.subjectDynamical Systems
dc.subjectMathematical Physics
dc.subjectMetric Geometry
dc.subjectPrimary 37A30; Secondary 37B10 52C23
dc.titleA Generalized Balanced Pair Algorithm
dc.typetext

Files

Collections

arXiv