Related papers: True trees are dense

Let $\psi:\mathbb{N} \to [0,\infty)$, $\psi(q)=q^{-(1+\tau)}$ and let $\psi$-badly approximable points be those vectors in $\mathbb{R}^{d}$ that are $\psi$-well approximable, but not $c\psi$-well approximable for arbitrarily small constants…

In this paper we obtain the rates of convergence of the algorithms given in [13] and [14] for an automatic computation of the centered Hausdorff and packing measures of a totally disconnected self-similar set. We evaluate these rates…

We present approximation algorithms for the following NP-hard optimization problems related to bottleneck spanning trees in metric spaces. 1. The disjoint bottleneck spanning tree problem: Given $n$ pairs of points in a metric space, find…

Given a $k$-point configuration $x\in (\mathbb{R}^d)^k$, we consider the $\binom{k}{d}$-vector of volumes determined by choosing any $d$ points of $x$. We prove that a compact set $E\subset \R^d$ determines a positive measure of such volume…

Geometry of networks endowed with a causal structure is discussed using the conventional framework of equilibrium statistical mechanics. The popular growing network models appear as particular causal models. We focus on a class of tree…

The Schm\"udgen's Positivstellensatz gives a certificate to verify positivity of a strictly positive polynomial $f$ on a compact, basic, semi-algebraic set $\mathbf{K} \subset \mathbb{R}^n$. A Positivstellensatz of this type is called…

We study geodesics in the random metric space called the Brownian map, which appears as the scaling limit of large planar maps. In particular, we completely describe geodesics starting from the distinguished point called the root, and we…

We quantify the density of rational points in the unit sphere $S^n$, proving analogues of the classical theorems on the embedding of $\q^n$ into $\r^n$. Specifically, we prove a Dirichlet theorem stating that every point $\alpha \in S^n$ is…

We prove that for any proper metric space $X$ and a function $\psi:(0,\infty)\to(0,\infty)$ from a suitable class of approximation functions, the Hausdorff dimensions of the set $W_\psi(Q)$ of all points $\psi$-well-approximable by a…

Optimal transport provides a metric which quantifies the dissimilarity between probability measures. For measures supported in discrete metric spaces, finding the optimal transport distance has cubic time complexity in the size of the…

We consider the problem of computing a Steiner tree of minimum cost under a hop constraint which requires the depth of the tree to be at most $k$. Our main result is an exact algorithm for metrics induced by graphs with bounded treewidth…

Let ${\cal T}=(T,w)$ be a weighted finite tree with leaves $1,..., n$.For any $I :=\{i_1,..., i_k \} \subset \{1,...,n\}$,let $D_I ({\cal T})$ be the weight of the minimal subtree of $T$ connecting $i_1,..., i_k$; the $D_{I} ({\cal T})$ are…

This paper is concerned with restricted families of projections in $\mathbb{R}^{3}$. Let $K \subset \mathbb{R}^{3}$ be a Borel set with Hausdorff dimension $\dim K = s > 1$. If $\mathcal{G}$ is a smooth and sufficiently well-curved…

The degree chromatic polynomial $Pm(G,k)$ of a graph $G$ counts the number of $k$-colorings in which no vertex has $m$ adjacent vertices of its same color. We prove Humpert and Martin's conjecture on the leading terms of the degree…

The \emph{Wiener polynomial} of a connected graph $G$ is the polynomial $W(G;x) = \sum_{i=1}^{D(G)} d_i(G)x^i$ where $D(G)$ is the diameter of $G$, and $d_i(G)$ is the number of pairs of vertices at distance $i$ from each other. We examine…

The Gy\'arf\'as tree packing conjecture states that any set of $n-1$ trees $T_{1},T_{2},..., T_{n-1}$ such that $T_i$ has $n-i+1$ vertices pack into $K_n$. We show that $t=1/10n^{1/4}$ trees $T_1,T_2,..., T_t$ such that $T_i$ has $n-i+1$…

In this paper, we investigate the Hausdorff measure of planar dominated self-affine sets at their affinity dimension. We show that the Hausdorff measure being positive and finite is equivalent to the K\"aenm\"aki measure being a mass…

We show that various categories of trees can be modeled by Grothendieck constructions on categories of trees with a fixed set of leaves. We prove this result for the dendroidal category $\Omega$, the category $\Omega^G$ of trees with a…

We give a short and elementary proof of the fact that every metric space of finite asymptotic dimension can be embedded into a finite product of trees.

We obtain a criterion for approximability by embeddings of piecewise linear maps of a circle to the plane, analogous to the one proved by Minc for maps of a segment to the plane. Theorem. Let S be a triangulation of a circle with s…