arXiv · 2512.12064
Euclidean-type algorithm for functions with same or similar origin
Abstract
Maps $f,g\colon X\to X$ are called kin if they are forward iterates of the same map $\varphi\colon X\to X$, up to a composition with a commuting homeomorphism. Kin form an important class of commuting maps on $X$. In this paper, we characterize kin, and give an Euclidean-type algorithm which tests when two maps $f,g\colon X\to X$ are kin. Furthermore, we compute the topological entropy of diagonal maps induced by commuting diagonal kin diagrams.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Ana Anušić, Christopher Mouron. 2025-12-12. Euclidean-type algorithm for functions with same or similar origin. https://arxiv.org/abs/2512.12064
Cite the original work for its findings. Save a collection to share your selection of sources.