Related papers: Outer linear measure of connected sets via Steiner…
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…
We consider the plus-phase of the two-dimensional Ising model below the critical temperature. In $1989$ Schonmann proved that the projection of this measure onto a one-dimensional line is not a Gibbs measure. After many years of continued…
Generalizing work from the 1970s on the determinants of distance hypermatrices of trees, we consider the hyperdeterminants of order-$k$ Steiner distance hypermatrices of trees on $n$ vertices. We show that they can be nearly diagonalized as…
Among other results, we prove the following theorem about Steiner minimal trees in $d$-dimensional Euclidean space: if two finite sets in $\mathbb{R}^d$ have unique and combinatorially equivalent Steiner minimal trees, then there is a…
In \cite{NaTa} Naor and Tao extended to the metric setting the $O(d \log d)$ bounds given by Stein and Str\"omberg for Lebesgue measure in $\mathbb{R}^d$, deriving these bounds first from a localization result, and second, from a random…
The eccentric sequence of a connected graph $G$ is the nondecreasing sequence of the eccentricities of its vertices. The Wiener index of $G$ is the sum of the distances between all unordered pairs of vertices of $G$. The unique trees that…
We establish maximal trees and graphs for the difference of average distance and proximity proving thus the corresponding conjecture posed in [4]. We also establish maximal trees for the difference of average eccentricity and remoteness and…
We translate Akin's notion of {\it good} (and related concepts) from measures on Cantor sets to traces on dimension groups, and particularly for invariant measures of minimal homeomorphisms (and their corresponding simple dimension groups),…
We construct near optimal linear decision trees for a variety of decision problems in combinatorics and discrete geometry. For example, for any constant $k$, we construct linear decision trees that solve the $k$-SUM problem on $n$ elements…
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…
We define a simple rule that allows to describe sequences of projective measurements for a broad class of generalized probabilistic models. This class embraces quantum mechanics and classical probability theory, but, for example, also the…
The Linear Arboricity Conjecture asserts that the linear arboricity of a graph with maximum degree $\Delta$ is $\lceil (\Delta+1)/2 \rceil$. For a $2k$-regular graph $G$, this implies $la(G) = k+1$. In this note, we utilize a network flow…
A causal set is a countably infinite poset in which every element is above finitely many others; causal sets are exactly the posets that have a linear extension with the order-type of the natural numbers -- we call such a linear extension a…
Recent years have witnessed a surge of biological interest in the minimum spanning tree (MST) problem for its relevance to automatic model construction using the distances between data points. Despite the increasing use of MST algorithms…
Fedorchuk's fully closed (continuous) maps and resolutions are applied in constructions of non-metrizable higher-dimensional analogues of Anderson, Choquet, and Cook's continua. Certain theorems on dimension-lowering maps are proved for…
We introduced non-linear traces of the Choquet type and the Sugeno type on semi-finite factors M in [36] as a non-commutative analog of the Choquet integral and Sugeno integral for non-additive measures. We need a weighted dimension…
Let $G$ be a connected graph and $\ell : E(G) \to \mathbb{R}^+$ a length-function on the edges of $G$. The Steiner distance $\mathrm{sd}_G(A)$ of $A \subseteq V(G)$ within $G$ is the minimum length of a connected subgraph of $G$ containing…
The Euclidean Steiner tree problem, normally posed in two dimensions, seeks to connect a set of prescribed terminal nodes by placing additional nodes, known as Steiner points, with edges connecting such nodes either to another Steiner point…
We consider a random tree and introduce a metric in the space of trees to define the ``mean tree'' as the tree minimizing the average distance to the random tree. When the resulting metric space is compact we have laws of large numbers and…
We consider the problem of packing edge-disjoint Steiner forests in a graph. The input consists of a multi-graph $G=(V,E)$ and a collection of $h$ vertex subsets $S = \{S_1,S_2,\ldots,S_h\}$. A Steiner forest for $S$, also called an…