Papers
Topics
Authors
Recent
Search
2000 character limit reached

Polish metric spaces with fixed distance set

Published 18 Sep 2018 in math.LO | (1809.06588v2)

Abstract: We study Polish spaces for which a set of possible distances $A \subseteq \mathbb{R}+$ is fixed in advance. We determine, depending on the properties of $A$, the complexity of the collection of all Polish metric spaces with distances in $A$, obtaining also example of sets in some Wadge classes where not many natural examples are known. Moreover we describe the properties that $A$ must have in order that all Polish spaces with distances in that set belong to a given class, such as zero-dimensional, locally compact, etc. These results lead us to give a fairly complete description of the complexity, with respect to Borel reducibility and again depending on the properties of $A$, of the relations of isometry and isometric embeddability between these Polish spaces.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.