Related papers: One-Sided Derivative of Distance to a Compact Set

To any non-negatively graded dg Lie algebra $g$ over a field $k$ of characteristic zero we assign a functor $\Sigma_g: art/k \to Kan$ from the category of commutative local artinian $k$-algebras with the residue field $k$ to the category of…

Let $Y$ be a subset of a metric space $X.$ We say that $Y$ is $\eta $-Gromov provided $Y$ is $\eta $-separated and not properly contained in any other $\eta $-separated subset of $X.$ In this paper, we review a result of Chew which says…

Let a \neq b be two positive scalars. A Euclidean representation of a simple graph G in R^r is a mapping of the nodes of G into points in R^r such that the squared Euclidean distance between any two points is a if the corresponding nodes…

Let $G$ be a group, $\mathcal{P}_G$ be the family of all subsets of $G$. For a subset $A\subseteq G$, we put $\Delta(A)=\{g\in G:|gA\cap A|=\infty\}$. The mapping $\Delta:\mathcal{P}_G\rightarrow\mathcal{P}_G$, $A\mapsto\Delta(A)$, is…

A vertex set $S$ of a graph $G$ is a \emph{dominating set} if each vertex of $G$ either belongs to $S$ or is adjacent to a vertex in $S$. The \emph{domination number} $\gamma(G)$ of $G$ is the minimum cardinality of $S$ as $S$ varies over…

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$.…

A geodesic in a graph G is a shortest path between two vertices of G. For a specific function e(n) of n, we define an almost geodesic cycle C in G to be a cycle in which for every two vertices u and v in C, the distance d_G(u,v) is at least…

The most studied and accepted pseudometric for probabilistic processes is one based on the Kantorovich distance between distributions. It comes with many theoretical and motivating results, in particular it is the fixpoint of a given…

This paper, the second of a series, deals with the function space of all smooth K\"ahler metrics in any given closed complex manifold $M$ in a fixed cohomology class. The previous result of the second author \cite{chen991} showed that the…

A topological space is said to be cardinality homogeneous if every nonempty open subset has the same cardinality as the space itself. Let $X$ and $Y$ be cardinality homogeneous metric spaces of the same cardinality. If there exists a…

For a graph $G$ spanning a metric space, the dilation of a pair of points is the ratio of their distance in the shortest path graph metric to their distance in the metric space. Given a graph $G$ and a budget $k$, a classic problem is to…

An extension $K/k$ of analytic (i.e. real valued complete) fields is called small if it is topologically-algebraically generated by finitely many elements. We prove that this property is inherited by subextensions and hence topological…

We deduce, as a consequence of the arithmetic removal lemma, an almost-all version of the Balog-Szemer\'{e}di-Gowers theorem: For any $K\geq 1$ and $\varepsilon > 0$, there exists $\delta = \delta(K,\varepsilon)>0$ such that the following…

By a quantum metric space we mean a C^*-algebra (or more generally an order-unit space) equipped with a generalization of the Lipschitz seminorm on functions which is defined by an ordinary metric. We develop for compact quantum metric…

Menger's theorem says that, for $k\ge0$, if $S, T$ are sets of vertices in a graph $G$, then either there are $k + 1$ vertex-disjoint paths between $S$ and $T$, or there is a set X of at most $k$ vertices such that every $S$-$T$ path passes…

Given a finitely-connected bounded planar domain $\Omega$, it is possible to define a {\it divergence distance} $D(x,y)$ from $x\in\Omega$ to $y\in\Omega$, which takes into account the complex geometry of the domain. This distance function…

A {\em faithful (unit) distance graph} in $\mathbb{R}^d$ is a graph whose set of vertices is a finite subset of the $d$-dimensional Euclidean space, where two vertices are adjacent if and only if the Euclidean distance between them is…

We consider an inhomogeneous version of the Barak-Erd\H{o}s graph, i.e. a directed Er\H{o}s-R\'enyi random graph on $\{1,\ldots,n\}$ with no loop. Given $f$ a Riemann-integrable non-negative function on $[0,1]^2$ and $\gamma > 0$, we define…

We find geodesics, shortest arcs, cut loci, first conjugate loci, distances between arbitrary elements for some left-invariant sub-Riemannian metrics on the Lie groups $SU(2)\times\mathbb{R}$ and $SO(3)\times\mathbb{R}$.

We establish an in-in formalism for geodesic deviation as an alternative to Synge calculus, based on a covariant calculus of differential forms in tangent bundle. This derives the exact Lagrangian and equations governing the finite geodesic…