2000 character limit reached
Path-homotopy is equivalent to -tree reduction
Published 16 Jan 2024 in math.AT, math.GN, and math.GT | (2401.08883v1)
Abstract: Suppose a path factors through an -tree as . Let parameterize the unique geodesic in joining the endpoints of . Then we say that the path is obtained from by "geodesic -tree reduction." Essentially, is obtained from by deleting one-dimensional back-tracking. In this paper, we show that any two homotopic paths are geodesic -tree reductions of some single common path. Hence, the equivalence relation on paths generated by geodesic -tree reduction is precisely path-homotopy. The common path is explicitly constructed and is necessarily space-filling in the image of a given path-homotopy.
Paper Prompts
Sign up for free to create and run prompts on this paper.