Related papers: Outer linear measure of connected sets via Steiner…
A classic theorem of Euclidean geometry asserts that any noncollinear set of $n$ points in the plane determines at least $n$ distinct lines. Chen and Chv\'atal conjectured that this holds for an arbitrary finite metric space, with a certain…
The Steiner distance of a graph, introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ and $S\subseteq V(G)$, the…
A rectilinear Steiner tree for a set $P$ of points in $\mathbb{R}^2$ is a tree that connects the points in $P$ using horizontal and vertical line segments. The goal of Minimal Rectilinear Steiner Tree is to find a rectilinear Steiner tree…
Linear theory provides a reasonable description of the velocity correlations of biased tracers both perpendicular and parallel to the line of separation, provided one accounts for the fact that the measurement is almost always made using…
The $k$-th spectral moment $M_k(G)$ of the adjacency matrix of a graph~$G$ represents the number of closed walks of length~$k$ in~$G$. We study here the partial order $\preceq$ of graphs, defined by $G\preceq H$ if $M_k(G)\leq M_k(H)$ for…
In this work, we study the metric Steiner Tree problem on graphs focusing on computing lower bounds for the integrality gap of the bi-directed cut (BCR) formulation and introducing a novel formulation, the Complete Metric (CM) model,…
Finite time coherent sets [8] have recently been defined by a measure based objective function describing the degree that sets hold together, along with a Frobenius-Perron transfer operator method to produce optimally coherent sets. Here we…
We consider the eternal distance-2 domination problem, recently proposed by Cox, Meger, and Messinger, on trees. We show that finding a minimum eternal distance-2 dominating set of a tree is linear time in the order of the graph by…
The girth of a graph is defined as the length of a shortest cycle in the graph. A $(k; g)$-cage is a graph of minimum order among all $k$-regular graphs with girth $g$. A cycle $C$ in a graph $G$ is termed nonseparating if the graph…
Consider a compact $M \subset \mathbb{R}^d$ and $r > 0$. A maximal distance minimizer problem is to find a connected compact set $\Sigma$ of the minimal length, such that \[ \max_{y \in M} dist (y, \Sigma) \leq r. \] The inverse problem is…
We establish a Shearer-type inequality for the Poincar\'e constant, showing that the Poincar\'e constant corresponding to the convolution of a collection of measures can be nontrivially controlled by the Poincar\'e constants corresponding…
We show that it is possible to formulate string theory as a "Galileon string theory". The galileon field $\chi$ enters in the definition of the integration measure in the action. Following the methods of the modified measure string theory,…
For any non-elementary hyperbolic group $\Gamma$, we find an outer automorphism invariant geodesic bicombing for the space of metric structures on $\Gamma$ equipped with a symmetrized version of the Thurston metric on Techim\"uller space.…
Let $G=(V,E)$ be a complete $n$-vertex graph with distinct positive edge weights. We prove that for $k\in\{1,2,...,n-1\}$, the set consisting of the edges of all minimum spanning trees (MSTs) over induced subgraphs of $G$ with $n-k+1$…
A linear forest is a forest in which every connected component is a path. The linear arboricity of a graph $G$ is the minimum number of linear forests of $G$ covering all edges. In 1980, Akiyama, Exoo and Harary proposed a conjecture, known…
A classical result of Robertson and Seymour (1986) states that the treewidth of a graph is linearly tied to its separation number: the smallest integer $k$ such that, for every weighting of the vertices, the graph admits a balanced…
The main subject of the paper, motivated by a question raised by Boshernitzan, is to give criteria for a bounded complex-valued sequence to be uncorrelated to any strictly ergodic sequence. As a tool developed to study this problem we…
We identify a structural pattern in the construction of known infinite families of trees whose independence polynomials are not log-concave. Using this pattern and properties of polynomial ring ideals, we derive linear recurrences for these…
The outer multiset dimension ${\rm dim}_{\rm ms}(G)$ of a graph $G$ is the cardinality of a smallest set of vertices that uniquely recognize all the vertices outside this set by using multisets of distances to the set. It is proved that…
We consider general Gaussian latent tree models in which the observed variables are not restricted to be leaves of the tree. Extending related recent work, we give a full semi-algebraic description of the set of covariance matrices of any…