Related papers: Self-similar sets, simple augmented trees, and the…
Given a Lipschitz map $f$ from a cube into a metric space, we find several equivalent conditions for $f$ to have a Lipschitz factorization through a metric tree. As an application we prove a recent conjecture of David and Schul. The…
$\delta$-hyperbolic graphs, originally conceived by Gromov in 1987, occur often in many network applications; for fixed $\delta$, such graphs are simply called hyperbolic graphs and include non-trivial interesting classes of "non-expander"…
We consider a class of iterated function systems (IFSs) of contracting similarities of $R^n$, introduced by Hutchinson, for which the invariant set possesses a natural H\"older continuous parameterization by the unit interval. When such an…
Gromov's isoperimetric gap conjecture for Hadamard spaces states that cycles in dimensions greater than or equal to the asymptotic rank admit linear isoperimetric filling inequalities, as opposed to the inequalities of Euclidean type in…
We study Minkowski contents and fractal curvatures of arbitrary self-similar tilings (constructed on a feasible open set of an IFS) and the general relations to the corresponding functionals for self-similar sets. In particular, we…
We introduce the notion of mixed subtree quasi-isometries, which are self quasi-isometries of regular trees built in a specific inductive way. We then show that any self quasi-isometry of a regular tree is at bounded distance from a…
We adapt a construction of Gabrielov and Vorobjov for use in the symmetric case. Gabrielov and Vorobjov had developed a means by which one may replace an arbitrary set $S$ definable in some o-minimal expansion of $\mathbb{R}$ with a compact…
The present paper is focused on the computation of the Lipschitz upper semicontinuity modulus of the feasible set mapping in the context of fully perturbed linear inequality systems; i.e., where all coefficients are allowed to be perturbed.…
We give a formalism for approximate isomorphism in continuous logic simultaneously generalizing those of two papers by Ben Yaacov and by Ben Yaacov, Doucha, Nies, and Tsankov, which are largely incompatible. With this we explicitly exhibit…
Building trees to represent or to fit distances is a critical component of phylogenetic analysis, metric embeddings, approximation algorithms, geometric graph neural nets, and the analysis of hierarchical data. Much of the previous…
The profinite iterated monodromy group (pfIMG) is a self-similar group associated to dynamical systems. We show that its proper open self-similar subgroups correspond to highly rigid semiconjugacies, which we partly classify in general. For…
We study probabilistic iterated function systems (IFS), consisting of a finite or infinite number of average-contracting bi-Lipschitz maps on R^d. If our strong open set condition is also satisfied, we show that both upper and lower bounds…
In this paper, we characterise graphs that are quasi-isometric to graphs with bounded treewidth. Specifically, we prove that a graph is quasi-isometric to a graph with bounded treewidth if and only if it has a tree-decomposition where each…
Lov\'asz (1967) showed that two finite relational structures A and B are isomorphic if, and only if, the number of homomorphisms from C to A is the same as the number of homomorphisms from C to B for any finite structure C. Soon after,…
We show that every regular graph with good local expansion has a spanning Lipschitz subgraph with large girth and minimum degree. In particular, this gives a finite analogue of the dynamical solution to the von Neumann problem by Gaboriau…
Hyperbolic fillings of metric spaces are a well-known tool for proving results on extending quasi-Moebius maps between boundaries of Gromov hyperbolic spaces to quasi-isometries between the spaces. For CAT(-1) spaces, and more generally…
In this paper, the second of a series of two, we continue the study of higher index theory for expanders. We prove that if a sequence of graphs has girth tending to infinity, then the maximal coarse Baum-Connes assembly map is an…
We say that a metric graph is uniformly bounded if the degrees of all vertices are uniformly bounded and the lengths of edges are pinched between two positive constants; a metric space is approximable by a uniform graph if there is one…
A function on a discrete group is weakly combable if its discrete derivative with respect to a combing can be calculated by a finite state automaton. A weakly combable function is bicombable if it is Lipschitz in both the left and right…
In this paper we attempt a self-contained approach to infinite dimensional Hamiltonian systems appearing from holomorphic curve counting in Gromov-Witten theory. It consists of two parts. The first one is basically a survey of Dubrovin's…