Related papers: Self-similar sets and Lipschitz graphs

We construct intrinsic Lipschitz graphs in Carnot groups with the property that, at every point, there exist infinitely many different blow-up limits, none of which is a homogeneous subgroup. This provides counterexamples to a Rademacher…

The purpose of this paper is to introduce and study some basic concepts of quantitative rectifiability in the first Heisenberg group $\mathbb{H}$. In particular, we aim to demonstrate that new phenomena arise compared to the Euclidean…

We show that for a metric space with an even number of points there is a 1-Lipschitz map to a tree-like space with the same matching number. This result gives the first basic version of an unoriented Kantorovich duality. The study of the…

We study two subspace systems in a separable infinite-dimensional Hilbert space up to (bounded) isomorphism. One of the main result of this paper is the following: Isomorphism classes of two subspace systems given by graphs of bounded…

Let $\Gamma$ be a closed subset of a complete Riemannian manifold $M$ of dimension $\geq 2$, let $f: M \to N$ be a Lipschitz map to a complete Riemannian manifold $N$, and let $\psi$ be a continuous function which dominates the local…

Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…

Linearly repetitive Delone sets are shown to be rectifiable by a bi-Lipschitz homeomorphisms of the Euclidean space that sends the Delone set to the set of points with integer coordinates.

Persistent Laplacians are matrix operators that track how the shape and structure of data transform across scales and are popularly adopted in biology, physics, and machine learning. Their eigenvalues are concise descriptors of geometric…

Given a dense countable set in a metric space, the infinite random geometric graph is the random graph with the given vertex set and where any two points at distance less than 1 are connected, independently, with some fixed probability. It…

We develop a new approach for approximating large independent sets when the input graph is a one-sided spectral expander - that is, the uniform random walk matrix of the graph has its second eigenvalue bounded away from 1. Consequently, we…

A $1$-Lipschitz map $f$ from a convex compact set to itself has fixed points. This consequence of Brouwer's or Schauder's fixed point theorem has more elementary proofs by approximating $f$ by $\lambda$-contractions, $f_\lambda$. We study…

We study the metric properties of finite subsets of L_1. The analysis of such metrics is central to a number of important algorithmic problems involving the cut structure of weighted graphs, including the Sparsest Cut Problem, one of the…

A Lorenz map $f:[0,1]\to[0,1]$ is a piecewise continuous map, modeled after an idealized version of the Lorenz attractor. In this paper we settle the following question - how much of the dynamics of the Lorenz attractor can be modeled by…

We show that in $\mathbb{R}^d$ there are purely unrectifiable sets of Hausdorff (and even box counting) dimension $d-1$ which are not tube null, settling a question of Carbery, Soria and Vargas, and improving a number of results by the same…

Kolmogorov asked the following question: can every bounded measurable set in the plane be mapped onto a polygon by a 1-Lipschitz map with arbitrarily small measure loss? The answer is negative in general, however, the case of compact sets…

A graph is said to be equimatchable if all its maximal matchings are of the same size. In this work we introduce two extensions of the property of equimatchability by defining two new graph parameters that measure how far a graph is from…

The present paper is concerned with Lipschitz properties of convex mappings. One considers the general context of mappings defined on an open convex subset $\Omega$ of a locally convex space $X$ and taking values in a locally convex space…

We prove that a typical compact set does not contain any similar copy of a given pattern. We also prove that a typical compact set of $[0,1]^{d} (d\geq 2)$ intersects any $(d-1)$-dimensional plane in at most $d$ points. We study the…

We extend the recent result of G. Godefroy which concerns the existence of non-norm attaining Lipschitz maps in order to characterize the norm attainment toward vectors for Lipschitz maps in the general setting of underlying space. The main…

In this paper, we extend the result of arXiv:2409.13662 by showing that the set on which every pseudotangent is obtained on a Lipschitz curve can be any compact, uniformly disconnected set in Euclidean space which admits any Lipschitz…