Related papers: Scoring metrics on separable metric spaces

We show that the statement ``In every separable pseudometric space there is a maximal non-strictly \delta-separated set.'' implies the axiom of choice for countable families of sets. This gives answers to a question of Dybowski and…

We survey some old and new results concerning the classification of complete metric spaces up to isometry, a theme initiated by Gromov, Vershik and others. All theorems concerning separable spaces appeared in various papers in the last…

Following the general principles of noncommutative geometry, it is possible to define a metric on the space of pure states of the noncommutative algebra generated by the coordinates. This metric generalizes the usual Riemannian one. We…

We introduce the property of countable separation for a locally convex Hausdorff space $X$ and relate it to the existence of a metrizable coarser topology. Building on this, we demonstrate how the separability of $X$ is equivalent to the…

In algorithms for finite metric spaces, it is common to assume that the distance between two points can be computed in constant time, and complexity bounds are expressed only in terms of the number of points of the metric space. We…

We determine the homeomorphism type of the space of smooth complete nonnegatively curved metrics on surfaces of positive Euler characteristic equipped with the topology of $C^\gamma$ uniform convergence on compact sets, when $\gamma$ is…

In this paper, we consider a CscK metric defined away from divisor and with metric upper bound and lower bound going to zero in certain rate. And we'll prove that this "nicely" behaved metric is a smooth CscK metric across the divisor.

Metrizable spaces are studied in which every closed set is an $\alpha$-limit set for some continuous map and some point. It is shown that this property is enjoyed by every space containing sufficiently many arcs (formalized in the notion of…

We investigate conditions under which a co-computably enumerable set in a computable metric space is computable. Using higher-dimensional chains and spherical chains we prove that in each computable metric space which is locally computable…

Metric spaces are generalized by many scholars. Recently, Khatami and Mirzavaziri use a mapping called $t$-definer to popularize the triangle inequality and give a generalization of the notion of a metric, which is called a $\star$-metric.…

We use countable metric spaces to code Polish metric spaces and evaluate the complexity of some statements about these codes and of some relations that can be determined by the codes. Also, we propose a coding for continuous functions…

We study homogeneity aspects of metric spaces in which all triples of distinct points admit pairwise different distances; such spaces are called isosceles-free. In particular, we characterize all homogeneous isosceles-free spaces up to…

Uniform measures are defined as the functionals on the space of bounded uniformly continuous functions that are continuous on bounded uniformly equicontinuous sets. If every cardinal has measure zero then every countably additive measure is…

We make a systematic study of frames for metric spaces. We prove that every separable metric space admits a metric $\mathcal{M}_d$-frame. Through Lipschitz-free Banach spaces we show that there is a correspondence between frames for metric…

Let X be a G-space such that the orbit space X/G is metrizable. Suppose a family of slices is given at each point of X. We study a construction which associates, under some conditions on the family of slices, with any metric on X/G an…

We introduce a class of variational principles on measure spaces which are causal in the sense that they generate a relation on pairs of points, giving rise to a distinction between spacelike and timelike separation. General existence…

We investigate a relations of almost isometric embedding and almost isometry between metric spaces and prove that with respect to these relations: (1) There is a countable universal metric space. (2) There may exist fewer than continuum…

Sequence comparison is a basic task to capture similarities and differences between two or more sequences of symbols, with countless applications such as in computational biology. An alignment is a way to compare sequences, where a giving…

In situations where forecasters are scored on the quality of their probabilistic predictions, it is standard to use `proper' scoring rules to perform such scoring. These rules are desirable because they give forecasters no incentive to lie…

Many concrete problems are formulated in terms of a finite set of points in $R^n$ which, via the ambient Euclidean metric, becomes a finite metric space. To obtain information from such a space, it is often useful to associate a graph to…