2000 character limit reached
Strong topology on the set of persistence diagrams
Published 21 May 2020 in math.GN and math.MG | (2005.10773v1)
Abstract: We endow the set of persistence diagrams with the strong topology (the topology of countable direct limit of increasing sequence of bounded subsets considered in the bottleneck distance). The topology of the obtained space is described. Also, we prove that the space of persistence diagrams with the bottleneck metric has infinite asymptotic dimension in the sense of Gromov.
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.