2000 character limit reached
Coarse equivalence versus bijective coarse equivalence of expander graphs
Published 21 Jul 2023 in math.MG, math.FA, and math.OA | (2307.11529v1)
Abstract: We provide a characterization of when a coarse equivalence between coarse disjoint unions of expander graphs is close to a bijective coarse equivalence. We use this to show that if the uniform Roe algebras of coarse disjoint unions of expanders graphs are isomorphic, then the metric spaces must be bijectively coarsely equivalent.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.