Related papers: Dimensions of tight spans
The notion of a spectral geometry on a compact metric space X is introduced. This notion serves as a discrete approximation of X motivated by the notion of a spectral triple from non-commutative geometry. A set of axioms charaterising…
In models of emergent gravity the metric arises as the expectation value of some collective field. Usually, many different collective fields with appropriate tensor properties are candidates for a metric. Which collective field describes…
We investigate how the metric dimension of infinite graphs change when we add edges to the graph. Our two main results: (1) there exists a growing sequence of graphs (under the subgraph relation, but without adding vertices) for which the…
A metric space is plastic if all its non-expansive bijections are isometries. We prove three main results: (1) every countable dense subspace of a normed space is not plastic, (2) every $k$-crowded separable metric space contains a plastic…
In this paper we consider flat metrics (semi-translation structures) on surfaces of finite type. There are two main results. The first is a complete description of when a set of simple closed curves is spectrally rigid, that is, when the…
The treewidth of a graph is an important invariant in structural and algorithmic graph theory. This paper studies the treewidth of line graphs. We show that determining the treewidth of the line graph of a graph $G$ is equivalent to…
We give sufficient conditions for a finite metric space to be determined by the magnitude function. In particular, a generic finite metric space such that the distances between the points are rationally independent is determined by the…
Let $G$ be a graph, and let $u$, $v$, and $w$ be vertices of $G$. If the distance between $u$ and $w$ does not equal the distance between $v$ and $w$, then $w$ is said to resolve $u$ and $v$. The metric dimension of $G$, denoted $\beta(G)$,…
Let $G$ be a graph and $S\subseteq V(G)$. If every two adjacent vertices of $G$ have different metric $S$-representations, then $S$ is a local metric generator for $G$. A local metric generator of smallest order is a local metric basis for…
Let $G=(V,E)$ be a simple, unweighted, connected graph. Let $d(u,v)$ denote the distance between vertices $u,v$. A resolving set of $G$ is a subset $S$ of $V$ such that knowing the distance from a vertex $v$ to every vertex in $S$ uniquely…
In a general triangulated category, the finiteness of the finitistic dimension serves as a prerequisite for a categorical obstruction, via the singularity category, to the existence of bounded $t$-structures. In this paper, we investigate…
A quasiconformal tree is a doubling metric tree in which the diameter of each arc is bounded above by a fixed multiple of the distance between its endpoints. We study the geometry of these trees in two directions. First, we construct a…
Let $P$ be a set of $n$ points in the plane in general position. We show that at least $\lfloor n/3\rfloor$ plane spanning trees can be packed into the complete geometric graph on $P$. This improves the previous best known lower bound…
Pointwise tangential dimensions are introduced for metric spaces. Under regularity conditions, the upper, resp. lower, tangential dimensions of X at x can be defined as the supremum, resp. infimum, of box dimensions of the tangent sets, a…
We construct a planar homogeneous self-similar measure, with strong separation, dense rotations and dimension greater than $1$, such that there exist lines for which dimension conservation does not hold and the projection of the measure is…
Given a point set $P$ in the Euclidean space, a geometric $t$-spanner $G$ is a graph on $P$ such that for every pair of points, the shortest path in $G$ between those points is at most a factor $t$ longer than the Euclidean distance between…
A realisation of a graph in the plane as a bar-joint framework is rigid if there are finitely many other realisations, up to isometries, with the same edge lengths. Each of these finitely-many realisations can be seen as a solution to a…
We introduce the notion of strong embeddability for a metric space. This property lies between coarse embeddability and property A. A relative version of strong embeddability is developed in terms of a family of set maps on the metric…
The sequence of middle divisors is shown to be unbounded. For a given number $n$, $a_{n,0}$ is the number of divisors of $n$ in between $\sqrt{n/2}$ and $\sqrt{2n}$. We explicitly construct a sequence of numbers $n(i)$ and a list of…
Statistical analysis of a graph often starts with embedding, the process of representing its nodes as points in space. How to choose the embedding dimension is a nuanced decision in practice, but in theory a notion of true dimension is…