Spaces that can be ordered effectively: virtually free groups and hyperbolicity
Anna Erschler, Ivan Mitrofanov

TL;DR
The paper investigates how metric spaces and groups can be ordered efficiently based on asymptotic invariants related to the traveling salesman problem, highlighting characterizations of virtually free groups and hyperbolic spaces.
Contribution
It characterizes virtually free groups via efficient ordering of 4-point subsets and demonstrates that hyperbolic spaces can be ordered very efficiently as the subset size grows.
Findings
Virtually free groups admit efficient orderings on 4-point subsets.
Hyperbolic spaces can be ordered extremely efficiently for large subsets.
Provides a classification of groups and spaces based on ordering efficiency.
Abstract
We study asymptotic invariants of metric spaces, defined in terms of the travelling salesman problem, and our goal is to classify groups and spaces depending on how well they can be ordered in this context. We characterize virtually free groups as those admitting an order which has some efficiency on -point subsets. We show that all -hyperbolic spaces can be ordered extremely efficiently, for the question when the number of points of a subset tends to .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Advanced Topology and Set Theory · Limits and Structures in Graph Theory
