Related papers: The minimal spanning tree and the upper box dimens…
We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show…
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 consider the lightest Higgs boson in naturally R-parity conserving supersymmetric left-right models. We obtain an upper bound on the tree level mass of this lightest Higgs boson. This upper bound depends on the $SU(2)_L$ and $SU(2)_R$…
Previous studies has shown that for a weighted undirected graph having $n$ vertices and $m$ edges, a minimal weight spanning tree can be found with $O^*(\sqrt{mn})$ calls to the weight oracle. The present note shows that a given spanning…
In this lecture we will consider the minimum weight spanning tree (MST) problem, i.e., one of the simplest and most vital combinatorial optimization problems. We will discuss a particular greedy algorithm that allows to compute a MST for…
In a general supersymmetric standard model there is an upper bound $m_h$ on the tree level mass of the $CP=+1$ lightest Higgs boson which depends on the electroweak scale, $\tan \beta$ and the gauge and Yukawa couplings of the theory. When…
We resolve a few questions regarding the uniformity and size of microsets of subsets of Euclidean space. First, we construct a compact set $K\subset\mathbb{R}^d$ with Assouad dimension arbitrarily close to $d$ such that every microset of…
Given an undirected, weighted graph, the minimum spanning tree (MST) is a tree that connects all of the vertices of the graph with minimum sum of edge weights. In real world applications, network designers often seek to quickly find a…
In order to investigate the phenomenological implications of warped spaces in more than five dimensions, we consider a $4+1+\delta$ dimensional extension to the Randall and Sundrum model in which the space is warped with respect to a single…
We study the problem of finding small trees. Classical network design problems are considered with the additional constraint that only a specified number $k$ of nodes are required to be connected in the solution. A prototypical example is…
Given an $n$-point metric space $(X,d_X)$, a tree cover $\mathcal{T}$ is a set of $|\mathcal{T}|=k$ trees on $X$ such that every pair of vertices in $X$ has a low-distortion path in one of the trees in $\mathcal{T}$. Tree covers have been…
We present a deterministic algorithm for computing the sensitivity of a minimum spanning tree (MST) or shortest path tree in $O(m\log\alpha(m,n))$ time, where $\alpha$ is the inverse-Ackermann function. This improves upon a long standing…
We consider the minimization of the NLS energy on a metric tree, either rooted or unrooted, subject to a mass constraint. With respect to the same problem on other types of metric graphs, several new features appear, such as the existence…
In this article, we study the Euclidean minimum spanning tree problem in an imprecise setup. The problem is known as the \emph{Minimum Spanning Tree Problem with Neighborhoods} in the literature. We study the problem where the neighborhoods…
We consider lower bounds on the number of spanning trees of connected graphs with degree bounded by $d$. The question is of interest because such bounds may improve the analysis of the improvement produced by memorisation in the runtime of…
In length-constrained minimum spanning tree (MST) we are given an $n$-node graph $G = (V,E)$ with edge weights $w : E \to \mathbb{Z}_{\geq 0}$ and edge lengths $l: E \to \mathbb{Z}_{\geq 0}$ along with a root node $r \in V$ and a…
We investigate the dimension of the set of points in the d-torus which have the property that their orbit under rotation by some alpha hits a fixed closed target A more often than expected for all finite initial portions. An upper bound for…
Let $T$ be a weighted tree. The weight of a subtree $T_1$ of $T$ is defined as the product of weights of vertices and edges of $T_1$. We obtain a linear-time algorithm to count the sum of weights of subtrees of $T$. As applications, we…
The minimum spanning tree of a graph is a well-studied structure that is the basis of countless graph theoretic and optimization problem. We study the minimum spanning tree (MST) perturbation problem where the goal is to spend a fixed…
A complete description is given of how minimal trees on atoms of the algebra of subsets $\mathfrak{A}_k$ generated by minimal spanning $k$-component forests of a weighted digraph $V$ determine the form of these forests and how forests grow…