A Generalized Balanced Pair Algorithm

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We 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.
Latex, 11 pages, no figures. Submitted to Topology Proceedings

Keywords

Dynamical Systems, Mathematical Physics, Metric Geometry, Primary 37A30; Secondary 37B10 52C23

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/68540

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0309194
 http://arxiv.org/abs/math/0309194
 Topology Proceedings Volume 28, No. 1, 2004

Collections

arXiv