Related papers: On uniqueness in Steiner problem
In this paper, we give improved bounds on the Hausdorff dimension of pinned distance sets of planar sets with dimension strictly less than one. As the planar set becomes more regular (i.e., the Hausdorff and packing dimension become…
We prove that if the Hausdorff dimension of a compact set $E \subset {\Bbb R}^2$ is greater than 7/4, then the set of {\ag three-point configurations determined by $E$ has positive three-dimensional measure}. We establish this by showing…
In the Euclidean Bottleneck Steiner Tree problem, the input consists of a set of $n$ points in $\mathbb{R}^2$ called terminals and a parameter $k$, and the goal is to compute a Steiner tree that spans all the terminals and contains at most…
Let $T$ be a finitely branching rooted tree such that any node has at least two successors. The path space $[T]$ is an ultrametric space: for distinct paths $f,g$ let $d(f,g)= 1/|T_n|$, where $T_n$ denotes the $n$-th level of the tree, and…
Recently, Stull [18], [17] resolved a long-standing open problem posed by Lutz, on whether the set of effective Hausdorff dimensions of points on a straight line in $\mathbb{R}^2$ -- the effective dimension spectrum of the line -- contains…
The concept of $n$-distance was recently introduced to generalize the classical definition of distance to functions of $n$ arguments. In this paper we investigate this concept through a number of examples based on certain geometrical…
Let $K\subseteq\mathbb{R}$ be the unique attractor of an iterated function system. We consider the case where $K$ is an interval and study those elements of $K$ with a unique coding. We prove under mild conditions that the set of points…
We prove that if $E\subseteq \R^2$ is analytic and $1<d < \dim_H(E)$, there are ``many'' points $x\in E$ such that the Hausdorff dimension of the pinned distance set $\Delta_x E$ is at least $d\left(1 -…
A directed network connecting a set A to a set B is a digraph containing an a-b path for each a in A and b in B. Vertices in the directed network not in A or B are called Steiner points. We show that in a finitely compact metric space in…
We introduce a notion of connected perimeter for planar sets defined as the lower semi-continuous envelope of perimeters of approximating sets which are measure-theoretically connected. A companion notion of simply connected perimeter is…
Since ancient times mathematicians consider geometrical objects with integral side lengths. We consider plane integral point sets $\mathcal{P}$, which are sets of $n$ points in the plane with pairwise integral distances where not all the…
Euclidean Steiner trees are relevant to model minimal networks in real-world applications ubiquitously. In this paper, we study the feasibility of a hierarchical approach embedded with bundling operations to compute multiple and mutually…
We discuss scaling limits of large bipartite planar maps. If p is a fixed integer strictly greater than 1, we consider a random planar map M(n) which is uniformly distributed over the set of all 2p-angulations with n faces. Then, at least…
Let $T(n)$ denote the maximum number of unit distances that a set of $n$ points in the Euclidean plane $\mathbb{R}^2$ can determine with the additional condition that the distinct unit length directions determined by the configuration must…
Recent years have witnessed rapid advances in the use of neural networks to solve combinatorial optimization problems. Nevertheless, designing the "right" neural model that can effectively handle a given optimization problem can be…
Bottleneck Steiner networks model energy consumption in wireless ad-hoc networks. The task is to design a network spanning a given set of terminals and at most $k$ Steiner points such that the length of the longest edge is minimised. The…
In this paper, we study the Hausdorff dimension of self-similar measures and sets on the real line, where the generating iterated function system consists of some maps that share the same fixed point. In particular, we will show that out of…
We study the metric Steiner tree problem in the sublinear query model. In this problem, for a set of $n$ points $V$ in a metric space given to us by means of query access to an $n\times n$ matrix $w$, and a set of terminals $T\subseteq V$,…
Given a compact $n$-dimensional immersed Riemannian manifold $M^n$ in some Euclidean space we prove that if the Hausdorff dimension of the singular set of the Gauss map is small, then $M^n$ is homeomorphic to the sphere $S^n$. Also, we…
A finite set $P$ of points in the plane is $n$-universal with respect to a class $\mathcal{C}$ of planar graphs if every $n$-vertex graph in $\mathcal{C}$ admits a crossing-free straight-line drawing with vertices at points of $P$. For the…