Related papers: Contractions in persistence and metric graphs
A cornerstone theorem in the Graph Minors series of Robertson and Seymour is the result that every graph $G$ with no minor isomorphic to a fixed graph $H$ has a certain structure. The structure can then be exploited to deduce far-reaching…
This paper studies higher index theory for a random sequence of bounded degree, finite graphs with diameter tending to infinity. We show that in a natural model for such random sequences the following hold almost surely: the coarse…
In this paper we study the persistent homology associated with topological crackle generated by distributions with an unbounded support. Persistent homology is a topological and algebraic structure that tracks the creation and destruction…
The main purpose of the paper is to construct a sequence of graphs of constant degree with indefinitely growing girths admitting embeddings into $\ell_1$ with uniformly bounded distortions. This result answers the problem posed by N.…
Suppose that $\{T_{a}:a\in G\}$ is a group of uniformly $L$-Lipschitzian mappings with bounded orbits $\left\{T_{a}x:a\in G\right\}$ acting on a hyperconvex metric space $M$. We show that if $L<\sqrt{2}$, then the set of common fixed points…
Suppose that S is a left amenable semitopological semigroup. We prove that if ${T_{t}: t \in S}$ is a uniformly k-Lipschitzian semigroup on a bounded closed and convex subset C of a Hilbert space and $k<\sqrt{2}$, then the set of fixed…
This work is motivated by the following question in data-driven study of dynamical systems: given a dynamical system that is observed via time series of persistence diagrams that encode topological features of solutions snapshots, what…
We study the homomorphism induced in homology by a closed correspondence between topological spaces, using projections from the graph of the correspondence to its domain and codomain. We provide assumptions under which the homomorphism…
We extend the notion of effective resistance to metric spaces that are similar to graphs but can also be similar to fractals. Combined with other basic facts proved in the paper, this lays the ground for a construction of Brownian Motion on…
It is well known that every sufficiently large connected graph has, as an induced subgraph, $K_n$, $K_{1,n}$, or an $n$-vertex path. A 2023 paper of Allred, Ding, and Oporowski identified a set of unavoidable induced subgraphs of…
We give an algorithm to compute the stable lengths of pseudo-Anosovs on the curve graph, answering a question of Bowditch. We also give a procedure to compute all invariant tight geodesic axes of pseudo-Anosovs. Along the way we show that…
In this article, we introduce a new type of mapping contracting perimeters of triangles in a complete metric space and present related fixed point theorem. We study the metric completeness property of the underlying space in terms of fixed…
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.…
By Bartle-Graves theorem every surjective map between C*-algebras has a continuous section, and Loring proved that that there exists a continuous section of norm arbitrary close to 1. Here we prove that there exists a continuous section of…
If $X$ is a compact set, a {\it topological contraction} is a self-embedding $f$ such that the intersection of the successive images $f^k(X)$, $k>0$, consists of one point. In dimension 3, we prove that there are smooth topological…
Graphs are a fundamental abstraction in computer science and discrete mathematics, where information is encoded in their combinatorial structure. Graph-reduction techniques aim at simplifying graphs while preserving selected structural…
Johnson and Lindenstrauss (Contemporary Mathematics, 1984) showed that for $n > m$, a scaled random projection $\mathbf{A}$ from $\mathbb{R}^n$ to $\mathbb{R}^m$ is an approximate isometry on any set $S$ of size at most exponential in $m$.…
Perfect graphs form one of the distinguished classes of finite simple graphs. In 2006, Chudnovsky, Robertson, Seymour and Thomas proved that a graph is perfect if and only if it has no odd holes and no odd antiholes as induced subgraphs,…
We show that if $G$ is a topological graph, and $f$ is continuous map, then the induced map $\tilde{f}$ acting on the hyperspace $C(G)$ of all connected subsets of $G$ by natural formula $\tilde{f}(C)=f(C)$ carries the same entropy as $f$.…
In our note we show the very close connection between the existence of a Finite Dimensional Decomposition (FDD for short) for a separable Banach space $X$ and the existence of a Lipschitz retraction of $X$ onto a small (in a certain precise…