Related papers: Direction sets, Lipschitz graphs and density

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$($ =…

We determine the minimal density of triangles in a tripartite graph with prescribed edge densities. This extends a previous result of Bondy, Shen, Thomass\'e and Thomassen characterizing those edge densities guaranteeing the existence of a…

Any symmetric affinity function $w: V\times V \to \mathbb{R}_+$ defined on a discrete set $V$ induces Euclidean space structure on $V$. In particular, an undirected graph specified by an affinity (or adjacency) matrix can be considered as a…

Rademacher theorem asserts that Lipschitz continuous functions between Euclidean spaces are differentiable almost everywhere. In this work we extend this result to set-valued maps using an adequate notion of set-valued differentiability…

We study the quantitative properties of Lipschitz mappings from Euclidean spaces into metric spaces. We prove that it is always possible to decompose the domain of such a mapping into pieces on which the mapping "behaves like a projection…

We prove that the regular $n\times n$ square grid of points in the integer lattice $\mathbb{Z}^{2}$ cannot be recovered from an arbitrary $n^{2}$-element subset of $\mathbb{Z}^{2}$ via a mapping with prescribed Lipschitz constant…

We show that the following elementary geometric properties of the motion of a discrete (i.e. piecewise linear) curve select the integrable dynamics of the Ablowitz-Ladik hierarchy of evolution equations: i) the set of points describing the…

In a crowd, individuals make different motion choices such as "moving to destination", "following another pedestrian", and "making a detour". For the sake of convenience, the three direction choices are respectively called destination…

We prove the equivalence of two seemingly very different ways of generalising Rademacher's theorem to metric measure spaces. One such generalisation is based upon the notion of forming partial derivatives along a very rich structure of…

A central question in dynamics is whether the topology of a system determines its geometry. This is known as rigidity. Under mild topological conditions rigidity holds for many classical cases, including: Kleinian groups, circle…

We study a discrete Laplace operator $\Delta$ on percolation subgraphs of an infinite graph. The ball volume is assumed to grow at most polynomially. We are interested in the behavior of the integrated density of states near the lower…

We solve the following three questions concerning surjective linear isometries between spaces of Lipschitz functions $\mathrm{Lip}(X,E)$ and $\mathrm{Lip}(Y,F)$, for strictly convex normed spaces $E$ and $F$ and metric spaces $X$ and $Y$:…

A multipath in a directed graph is a disjoint union of paths. The multipath complex of a directed graph ${\tt G}$ is the simplicial complex whose faces are the multipaths of ${\tt G}$. We compute the Euler characteristic, and associated…

We prove that for any complex manifold X, the set of all holomorphic maps from the unit disc to X whose images are everywhere dense in X forms a dense subset in the space of all holomorphic maps from the disc to X. We show by an example…

A dominating set of a graph is a set of vertices such that every vertex not in the set has at least one neighbor in the set. The problem of counting dominating sets is #P-complete for chordal graphs but solvable in polynomial time for its…

In this short note, we show that, in any given metric space, every Lipschitz open-map image of every subset of a given metric space whose boundary is Hausdorff-null is Hausdorff-measurable with respect to the same dimension. The main…

We consider a nonlocal equation set in an unbounded domain with the epigraph property. We prove symmetry, monotonicity and rigidity results. In particular, we deal with halfspaces, coercive epigraphs and epigraphs that are flat at infinity.

Let $D$ be a connected oriented graph. A set $S \subseteq V(D)$ is convex in $D$ if, for every pair of vertices $x, y \in S$, the vertex set of every $xy$-geodesic, ($xy$ shortest directed path) and every $yx$-geodesic in $D$ is contained…

Let $D$ be a directed graphs with distinguished sets of sources $S\subseteq V(D)$ and sinks $T\subseteq V(D)$. A tripod in $D$ is a subgraph consisting of the union of two $S$-$T$-paths that have distinct start-vertices and the same…

Let $U$ be a point set in the $n$-dimensional affine space ${\rm AG}(n,q)$ over the finite field of $q$ elements and $0\leq k\leq n-2$. In this paper we extend the definition of directions determined by $U$: a $k$-dimensional subspace $S_k$…