Related papers: Large dilates of hypercube graphs in the plane

We consider large random planar maps and study the first-passage percolation distance obtained by assigning independent identically distributed lengths to the edges. We consider the cases of quadrangulations and of general planar maps. In…

Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distances rather than their actual values. Lower and upper bounds for…

We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…

For a large class of separable Banach spaces, we prove the real analytic Dolbeault Isomorphism Theorem for open subsets.

A subset of a Banach space is called equilateral if the distances between any two of its distinct elements are the same. It is proved that there exist non-separable Banach spaces (in fact of density continuum) with no infinite equilateral…

We investigate the set a) of positive, trace preserving maps acting on density matrices of size N, and a sequence of its nested subsets: the sets of maps which are b) decomposable, c) completely positive, d) extended by identity impose…

In the nonlinear geometry of Banach spaces where the objects in the category are Banach spaces as in the linear case, the morphisms in the new setting are taken to comprise of certain nonlinear maps involving say, Lipschitz maps and, in…

Distance well-defined graphs consist of connected undirected graphs, strongly connected directed graphs and strongly connected mixed graphs. Let $G$ be a distance well-defined graph, and let ${\sf D}(G)$ be the distance matrix of $G$.…

Geometric graphs appear in many real-world data sets, such as road networks, sensor networks, and molecules. We investigate the notion of distance between embedded graphs and present a metric to measure the distance between two geometric…

We consider the problem of isometric embedding of metric spaces to the Banach spaces; and introduce and study the remarkable class of so-called linearly rigid metric spaces: these are the spaces that admit a unique, up to isometry, linearly…

Perfect codes in the $n$-dimensio\-nal grid $\Lambda_n$ of the lattice $\mathbb{Z}^n$ ($0<n\in\mathbb{Z}$) and its quotient toroidal grids were obtained via the truncated distance in $\mathbb{Z}^n$ given between $u=(u_1,\cdots,u_n)$ and…

In this paper we introduce a class of pseudo-dissipative holomorphic maps which contains, in particular, the class of infinitesimal generators of semigroups of holomorphic maps on the unit ball of a complex Banach space. We give a growth…

An infinite dimensional notion of asymptotic structure is considered. This notion is developed in terms of trees and branches on Banach spaces. Every countably infinite countably branching tree $\mathcal T$ of a certain type on a space X is…

For each positive integer $n$, let $G_n$ be the graph of integer partitions of $n$, where two partitions are adjacent if one is obtained from the other by an elementary transfer of a cell in the Ferrers diagram, followed by reordering.…

Let $\Gamma$ be a graph with diameter at least two. Then $\Gamma$ is said to be $1$-homogeneous (in the sense of Nomura) whenever for every pair of adjacent vertices $x$ and $y$ in $\Gamma$, the distance partition of the vertex set of…

In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…

A gauge $\gamma$ in a vector space $X$ is a distance function given by the Minkowski functional associated to a convex body $K$ containing the origin in its interior. Thus, the outcoming concept of gauge spaces $(X, \gamma)$ extends that of…

This paper addresses the problem of determining the maximum number of edges in a unit distance graph (UDG) of $n$ vertices using computer search. An unsolved problem of Paul Erd\H{o}s asks the maximum number of edges $u(n)$ a UDG of $n$…

We show that, for a constant-degree algebraic curve $\gamma$ in $\mathbb{R}^D$, every set of $n$ points on $\gamma$ spans at least $\Omega(n^{4/3})$ distinct distances, unless $\gamma$ is an {\it algebraic helix} (see Definition 1.1). This…

Given a measurable set $A\subset \mathbb R^d$ we consider the "large-distance graph" $\mathcal{G}_A$, on the ground set $A$, in which each pair of points from $A$ whose distance is bigger than 2 forms an edge. We consider the problems of…