Related papers: Coding Polish spaces
We present and thoroughly study natural Polish spaces of separable Banach spaces. These spaces are defined as spaces of norms, resp. pseudonorms, on the countable infinite-dimensional rational vector space. We provide an exhaustive…
We give a partial answer to an important open problem in descriptive set theory, the Decomposability Conjecture for Borel functions on an analytic subset of a Polish space to a separable metrizable space. Our techniques employ deep results…
Given Polish space ${\bf Y}$ and continuous language $L$ we study the corresponding logic $\mathsf{Iso}({\bf Y})$-space ${\bf Y}_L$. We build a framework of generalized model theory towards analysis of Borel/algorithmic complexity of…
The purpose of this article is to relate coarse cohomology of metric spaces with a more computable cohomology. We introduce a notion of boundedly supported cohomology and prove that coarse cohomology of many spaces are isomorphic to the…
We develop an analog to the ends of a metric space for the category of coarse metric spaces and show that it is equivalent to a previously defined coarse invariant.
We formulate explicit predictions concerning the symmetry of optimal codes in compact metric spaces. This motivates the study of optimal codes in various spaces where these predictions can be tested.
We determine the exact complexity of classifying compact metric spaces up to homeomorphism. More precisely, the homeomorphism relation on compact metric spaces is Borel bi-reducible with the complete orbit equivalence relation of Polish…
In spacetime physics, we frequently need to consider a set of all spaces (`universes') as a whole. In particular, the concept of `closeness' between spaces is essential. However, there has been no established mathematical theory so far…
We show that, for a coanalytic subspace $X$ of $2^\omega$, the countable dense homogeneity of $X^\omega$ is equivalent to $X$ being Polish. This strengthens a result of Hru\v{s}\'ak and Zamora Avil\'es. Then, inspired by results of…
We define scoring metrics on separable metric spaces and show that they are always no coarser than the metrics from which they spring.
Computable analysis and effective descriptive set theory are both concerned with complete metric spaces, functions between them and subsets thereof in an effective setting. The precise relationship of the various definitions used in the two…
We define a model for rank one measure preserving transformations in the sense of [2]. This is done by defining a new Polish topology on the space of codes, which are infinite rank one words, for symbolic rank one systems. We establish that…
In this paper, we study the connection between polar codes and product codes. Our analysis shows that the product of two polar codes is again a polar code, and we provide guidelines to compute its frozen set on the basis of the frozen sets…
We define and prove characterizations of Hardy-Orlicz spaces of conformal densities.
There are versions of "calculus" in many settings, with various mixtures of algebra and analysis. In these informal notes we consider a few examples that suggest a lot of interesting questions.
Dimensional types of metric scattered spaces are investigated. Revised proofs of Mazurkiewicz-Sierpi\'nski and Knaster-Urbanik theorems are presented. Embeddable properties of countable metric spaces are generalized onto uncountable metric…
We classify the metric spaces that can be approximated by finite homogeneous ones.
We set up a model for reasoning about metric spaces with belief theoretic measures. The uncertainty in these spaces stems from both probability and metric. To represent both aspect of uncertainty, we choose an expected distance function as…
We investigate powerspace constructions on topological spaces, with a particular focus on the category of quasi-Polish spaces. We show that the upper and lower powerspaces commute on all quasi-Polish spaces, and show more generally that…
We study the isomorphism relation on Borel classes of locally compact Polish metric structures. We prove that isomorphism on such classes is always classifiable by countable structures (equivalently: Borel reducible to graph isomorphism),…