Related papers: On uniqueness in Steiner problem

We study connectivity problems from a fine-grained parameterized perspective. Cygan et al. (TALG 2022) obtained algorithms with single-exponential running time $\alpha^{tw} n^{O(1)}$ for connectivity problems parameterized by treewidth…

Given a set $P$ of $n$ points in the plane, we solve the problems of constructing a geometric planar graph spanning $P$ 1) of minimum degree 2, and 2) which is 2-edge connected, respectively, and has max edge length bounded by a factor of 2…

This paper explicitly constructs the complete set of optimal sub-Riemannian geodesics starting from a point for certain Carnot groups of step two. These are groups of dimension 2n+1 equipped with a left-invariant distribution of dimension…

In this article, we study the regularity of minimizing and stationary $p$-harmonic maps between Riemannian manifolds. The aim is obtaining Minkowski-type volume estimates on the singular set $S(f)=\{x \ \ s.t. \ \ f \text{ is not continuous…

We provide proofs certifying that the structure theorem for vertex sets of bounded bidimensionality holds with polynomial bounds. The bidimensionality of vertex sets is a common generalisation of both treewidth and the face-cover-number of…

Let $s \in [0,1]$. We show that a Borel set $N \subset \mathbb{R}^{2}$ whose every point is linearly accessible by an $s$-dimensional family of lines has Hausdorff dimension at most $2 - s$.

In this paper we consider affine iterated function systems in locally compact non-Archimedean field $\mathbb{F}$. We establish the theory of singular value composition in $\mathbb{F}$ and compute box and Hausdorff dimension of self-affine…

We study the structure of planar point sets that determine a small number of distinct distances. Specifically, we show that if a set P of n points determines o(n) distinct distances, then no line contains \Omega(n^{7/8}) points of P and no…

We review the motivation and fundamental properties of the Hausdorff dimension of metric spaces and illustrate this with a number of examples, some of which are expected and well-known. We also give examples where the Hausdorff dimension…

We prove that harmonic maps into Euclidean buildings, which are not necessarily locally finite, have singular sets of Hausdorff codimension 2, extending the locally finite regularity result of Gromov and Schoen. As an application, we prove…

Let $P$ be a set of $n$ points in real projective $d$-space, not all contained in a hyperplane, such that any $d$ points span a hyperplane. An ordinary hyperplane of $P$ is a hyperplane containing exactly $d$ points of $P$. We show that if…

A spanning tree $T$ of graph $G$ is a $\rho$-approximate universal Steiner tree (UST) for root vertex $r$ if, for any subset of vertices $S$ containing $r$, the cost of the minimal subgraph of $T$ connecting $S$ is within a $\rho$ factor of…

We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…

Let $F$ be an $n$-point set in $\mathbb{K}^d$ with $\mathbb{K}\in\{\mathbb{R},\mathbb{Z}\}$ and $d\geq 2$. A (discrete) X-ray of $F$ in direction $s$ gives the number of points of $F$ on each line parallel to $s$. We define…

Many real-world machine learning problems involve inherently hierarchical data, yet traditional approaches rely on Euclidean metrics that fail to capture the discrete, branching nature of hierarchical relationships. We present a theoretical…

This work introduces two new notions of dimension, namely the unimodular Minkowski and Hausdorff dimensions, which are inspired from the classical analogous notions. These dimensions are defined for unimodular discrete spaces, introduced in…

Uniqueness in the Calder\'on problem in dimension bigger than two was usually studied under the assumption that conductivity has bounded gradient. For conductivities with unbounded gradients uniqueness results have not been known until…

It is shown that a minimum weight spanning tree of a finite ultrametric space can be always found in the form of path. As a canonical representing tree such path uniquely defines the whole space and, moreover, it has much more simple…

We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, we show how to build a Steiner forest spanner for such graphs.…

After giving a general introduction to the main known results on the anisotropic Calder{\'o}n problem on n-dimensional compact Riemannian manifolds with boundary, we give a motivated review of some recent non-uniqueness results obtained in…