Related papers: Games and Scott sentences for positive distances b…
The distance on a set is a comparative function. The smaller the distance between two elements of that set, the closer, or more similar, those elements are. Fr\'echet axiomatized the distance into what is today known as a metric. In this…
In the present paper we investigate the Gromov--Hausdorff distances between a bounded metric space $X$ and so called simplex, i.e., a metric space all whose non-zero distances are the same. In the case when the simplex's cardinality does…
We discuss the back and forth technique in the context of presheaf model theory. The essence of the back and forth technique lies in showing the relationship between various hierarchies which calibrate similarity between two models and,…
We define a distance analogous to the Gromov-Hausdorff distance that enables the comparison of arbitrary quasi-isometric spaces. We also investigate properties preserved under limits with respect to this distance, as well as properties of…
The aim of the present article is to give an introduction to the concept of quasi-unitary equivalence and to define several (pseudo-)metrics on the space of self-adjoint operators acting possibly in different Hilbert spaces. As some of the…
This is an experiential study of investigating a consistent method for deriving the correlation between sentence vector and semantic meaning of a sentence. We first used three state-of-the-art word/sentence embedding methods including…
Winning sets of Schmidt's game enjoy a remarkable rigidity. Therefore, this game (and modifications of it) have been applied to many examples of complete metric spaces (X, d) to show that the set of "badly approximable points", with respect…
Bisimulation metrics provide a robust and accurate approach to study the behavior of nondeterministic probabilistic processes. In this paper, we propose a logical characterization of bisimulation metrics based on a simple probabilistic…
In many real-world applications data come as discrete metric spaces sampled around 1-dimensional filamentary structures that can be seen as metric graphs. In this paper we address the metric reconstruction problem of such filamentary…
We use Ehrenfeucht-Fra\"iss\'e games to give a local geometric criterion for elementary equivalence of II$_1$ factors. We obtain as a corollary that two II$_1$ factors are elementarily equivalent if and only their unitary groups are…
Geometric graphs appear in many real-world data sets, such as road networks, sensor networks, and molecules. We investigate the notion of distance between embedded graphs and present a metric to measure the distance between two geometric…
We show that compact Riemannian manifolds, regarded as metric spaces with their global geodesic distance, cannot contain a number of rigid structures such as (a) arbitrarily large regular simplices or (b) arbitrarily long sequences of…
Ehrenfeucht-Fra\"iss\'e (EF) games are a basic tool in finite model theory for proving definability lower bounds, with many applications in complexity theory and related areas. They have been applied to study various logics, giving insights…
Over the past few years, symmetric positive definite (SPD) matrices have been receiving considerable attention from computer vision community. Though various distance measures have been proposed in the past for comparing SPD matrices, the…
On a complete, connected, locally compact, non-compact geodesic space $(X,d)$, we assign each compact set a distance-like function. With the help of these functions, we obtain a pseudo-metric on the space of (non-empty) compact subsets of…
By a "happy fractal" we mean a metric space with bounded geometry in the sense of a doubling condition and a lot of paths of finite length, so that any pair of points can be connected by a path whose length is less than or equal to a…
We lay out a general method for computing branching distances between labeled transition systems. We translate the quantitative games used for defining these distances to other, path-building games which are amenable to methods from the…
We lift metrics over words to metrics over word-to-word transductions, by defining the distance between two transductions as the supremum of the distances of their respective outputs over all inputs. This allows to compare transducers…
Combinatorial games are widely used in finite model theory, constraint satisfaction, modal logic and concurrency theory to characterize logical equivalences between structures. In particular, Ehrenfeucht-Fraisse games, pebble games, and…
We show that the set of numbers with bounded L\"uroth expansions (or bounded L\"uroth series) is winning and strong winning. From either winning property, it immediately follows that the set is dense, has full Hausdorff dimension, and…