相关论文: Approximate Capture in Gromov-Hausdorff Closed Spa…

We study a variant of the classical cop-robber game played on compact metric graphs, where each edge is assigned a positive length and identified with a real interval of corresponding length. In this setting, both the cop and the robber…

It is proved that the Gromov-Hausdorff metric on the space of compact metric spaces considered up to an isometry is strictly intrinsic, i.e., the corresponding metric space is geodesic. In other words, each two points of this space (each…

In this paper we study the space $\mathcal{M}$ of all nonempty compact metric spaces considered up to isometry, equipped with the Gromov--Hausdorff distance. We show that each ball in $\mathcal{M}$ with center at the one-point space is…

A quantized metric space is a matrix order unit space equipped with an operator space version of Rieffel's Lip-norm. We develop for quantized metric spaces an operator space version of quantum Gromov-Hausdorff distance. We show that two…

By Gromov's compactness theorem for metric spaces, every uniformly compact sequence of metric spaces admits an isometric embedding into a common compact metric space in which a subsequence converges with respect to the Hausdorff distance.…

We provide an alternative, constructive proof that the collection $\mathcal{M}$ of isometry classes of compact metric spaces endowed with the Gromov-Hausdorff distance is a geodesic space. The core of our proof is a construction of explicit…

We consider the following generalization of the classical pursuit-evasion problem, which we call k-capture. A group of n pursuers (hyenas) wish to capture an evader (lion) who is free to move in an m-dimensional Euclidean space, the…

Hirschfeldt and Jockusch (2016) introduced a two-player game in which winning strategies for one or the other player precisely correspond to implications and non-implications between $\Pi^1_2$ principles over $\omega$-models of…

In a pursuit evasion game on a finite, simple, undirected, and connected graph $G$, a first player visits vertices $m_1,m_2,\ldots$ of $G$, where $m_{i+1}$ is in the closed neighborhood of $m_i$ for every $i$, and a second player probes…

This paper considers a reach-avoid differential game in three-dimensional space with four equal-speed players. A plane divides the game space into a play subspace and a goal subspace. The evader aims at entering the goal subspace while…

By a quantum metric space we mean a C^*-algebra (or more generally an order-unit space) equipped with a generalization of the Lipschitz seminorm on functions which is defined by an ordinary metric. We develop for compact quantum metric…

In this paper, we focus on the distance estimate problem on complete manifolds with compact boundary and with lower scalar curvature bounds. On these manifolds, relative to a background manifold with nonnegative curvature operator, we…

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…

This paper introduced a pursuit and evasion game to be played on a connected graph. One player moves invisibly around the graph, and the other player must guess his position. At each time step the second player guesses a vertex, winning if…

A lion and a man move continuously in a space $X$. The aim of the lion is to capture his prey while the man wants to escape forever. Which of them has a strategy? This question has been studied for different metric domains. In this article…

Grasping is essential in robotic manipulation, yet challenging due to object and gripper diversity and real-world complexities. Traditional analytic approaches often have long optimization times, while data-driven methods struggle with…

We construct a compact metric space that has any other compact metric space as a tangent, with respect to the Gromov-Hausdorff distance, at all points. Furthermore, we give examples of compact sets in the Euclidean unit cube, that have…

The classical Reifenberg's theorem says that a set which is sufficiently well approximated by planes uniformly at all scales is a topological H\"older manifold. Remarkably, this generalizes to metric spaces, where the approximation by…

We consider the pursuit and evasion game on finite, connected, undirected graphs known as cops and robbers. Meyniel conjectured that for every graph on n vertices a rootish number of cops can win the game. We prove that this holds up to a…

This paper considers a subspace guarding game in high-dimensional space which consists of a play subspace and a target subspace. Two faster defenders cooperate to protect the target subspace by capturing an attacker which strives to enter…