Related papers: Self-similar sets and Lipschitz graphs

We study classes of domains in $\mathbb{R}^{d+1},\ d \geq 2$ with sufficiently flat boundaries that admit a decomposition or covering of bounded overlap by Lipschitz graph domains with controlled total surface area. This study is motivated…

We consider the iterated function systems (IFSs) that consist of three general similitudes in the plane with centres at three non-collinear points, and with a common contraction factor $\la\in(0,1)$. As is well known, for $\la=1/2$ the…

Given an iterated function system (IFS) of contractive similitudes, the theory of Gromov hyperbolic graph on the IFS has been established recently. In the paper, we introduce a notion of simple augmented tree which is a Gromov hyperbolic…

We compare the dimension of a non-invertible self-affine set to the dimension of the respective invertible self-affine set. In particular, for generic planar self-affine sets, we show that the dimensions coincide when they are large and…

We consider the question which compact metric spaces can be obtained as a Lipschitz image of the middle third Cantor set, or more generally, as a Lipschitz image of a subset of a given compact metric space. In the general case we prove that…

In their 1991 and 1993 foundational monographs, David and Semmes characterized uniform rectifiability for subsets of Euclidean space in a multitude of geometric and analytic ways. The fundamental geometric conditions can be naturally stated…

We study the asymptotic dynamics of maps which are piecewise contracting on a compact space. These maps are Lipschitz continuous, with Lipschitz constant smaller than one, when restricted to any piece of a finite and dense union of disjoint…

Lipschitz learning is a graph-based semi-supervised learning method where one extends labels from a labeled to an unlabeled data set by solving the infinity Laplace equation on a weighted graph. In this work we prove uniform convergence…

A theorem of Ding, Oporowski, Oxley, and Vertigan implies that any sufficiently large twin-free graph contains a large matching, a co-matching, or a half-graph as a semi-induced subgraph. The sizes of these unavoidable patterns are measured…

In Euclidean space of dimension 2 or 3, we study a minimum time problem associated with a system of real-analytic vector fields satisfying H\"ormander's bracket generating condition, where the target is a nonempty closed set. We show that,…

For a given graph whose edges are labeled with general real numbers, we consider the set of functions from the vertex set into the Euclidean plane such that the distance between the images of neighbouring vertices is equal to the…

Graph symmetries intervene in diverse applications, from enumeration, to graph structure compression, to the discovery of graph dynamics (e.g., node arrival order inference). Whereas Erd\H{o}s-R\'enyi graphs are typically asymmetric, real…

Let $K\subseteq\mathbb{R}$ be the unique attractor of an iterated function system. We consider the case where $K$ is an interval and study those elements of $K$ with a unique coding. We prove under mild conditions that the set of points…

A closed subset of $\mathbb{R}^q$, definable in some given o-minimal structure, is Lipschitz normally embedded in $\mathbb{R}^q$ if and only if its one-point compactification is Lipschitz normally embedded in the unit sphere ${\bf S}^q$($ =…

In a former paper the first and third authors introduced the notion of direction set for a subset of R^n, and showed that the dimension of the common direction set of two subanalytic subsets, called directional dimension, is preserved by a…

Homogeneous random fractals form a probabilistic extension of self-similar sets with more dependencies than in random recursive constructions. For such random fractals we consider mean values of the Lipschitz-Killing curvatures of their…

We consider a class of homogeneous self-similar sets with complete overlaps and give a sufficient condition for the Lipschitz equivalence between members in this class.

We introduce Lipschitz continuous and $C^{1,1}$ geometric approximation and interpolation methods for sampled bounded uniformly continuous functions over compact sets and over complements of bounded open sets in $\mathbb{R}^n$ by using…

Let $d\geq 3$ be a fixed integer and $A$ be the adjacency matrix of a random $d$-regular directed or undirected graph on $n$ vertices. We show there exist constants $\mathfrak d>0$, \begin{align*} {\mathbb P}(\text{$A$ is singular in…

We explore a reconfiguration version of the dominating set problem, where a dominating set in a graph $G$ is a set $S$ of vertices such that each vertex is either in $S$ or has a neighbour in $S$. In a reconfiguration problem, the goal is…