相关论文: Perturbative classical conformal blocks as Steiner…

Given a set $P$ of terminals in the plane and a partition of $P$ into $k$ subsets $P_1, ..., P_k$, a two-level rectilinear Steiner tree consists of a rectilinear Steiner tree $T_i$ connecting the terminals in each set $P_i$ ($i=1,...,k$)…

We construct an example of an infinite planar embedded self-similar binary tree $\Sigma$ which is the essentially unique solution to the Steiner problem of finding the shortest connection of a given planar self-similar fractal set $C$ of…

Embeddings of graphs into distributions of trees that preserve distances in expectation are a cornerstone of many optimization algorithms. Unfortunately, online or dynamic algorithms which use these embeddings seem inherently randomized and…

In this note we discuss a possible holographic dual of the two dimensional conformal field theory associated with the world-sheet of a macroscopic superstring in a compactification on four-torus. We assume the near horizon geometry of the…

We study two problems that seek a subtree $T$ of a graph $G=(V,E)$ such that $T$ satisfies a certain property and has minimal maximum degree. - In the Min-Degree Group Steiner Tree problem we are given a collection ${\cal S}$ of groups…

We continue to develop the holographic interpretation of classical conformal blocks in terms of particles propagating in an asymptotically $AdS_3$ geometry. We study $n$-point block with two heavy and $n-2$ light fields. Using the worldline…

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…

The Steiner tree problems are well-known NP-hard problems that have diverse applications. Duin et al. (2004) have intuitively proposed the widely-used transformation from the classical group Steiner tree problem to the classical Steiner…

Given two sets of points in the plane, $P$ of $n$ terminals and $S$ of $m$ Steiner points, a Steiner tree of $P$ is a tree spanning all points of $P$ and some (or none or all) points of $S$. A Steiner tree with length of longest edge…

A homeomorphically irreducible spanning tree (HIST) is a spanning tree with no degree-2 vertices, serving as a structurally minimal backbone of a graph. While the existence of HISTs has been widely studied from a structural perspective, the…

Inspired by group cohomology, we define several coarse topological invariants of metric spaces. We define the coarse cohomological dimension of a metric space, and demonstrate that if G is a countable group, then the coarse cohomological…

Consider the complete graph on $n$ vertices, with edge weights drawn independently from the exponential distribution with unit mean. Janson showed that the typical distance between two vertices scales as $\log{n}/n$, whereas the diameter…

Given a directed graph $G$ and a list $(s_1,t_1),\dots,(s_d,t_d)$ of terminal pairs, the Directed Steiner Network problem asks for a minimum-cost subgraph of $G$ that contains a directed $s_i\to t_i$ path for every $1\le i \le k$. The…

We study the Steiner Tree problem, in which a set of terminal vertices needs to be connected in the cheapest possible way in an edge-weighted graph. This problem has been extensively studied from the viewpoint of approximation and also…

Hyperbolic spaces, which have the capacity to embed tree structures without distortion owing to their exponential volume growth, have recently been applied to machine learning to better capture the hierarchical nature of data. In this…

We study a coarse homology theory with prescribed growth conditions. For a finitely generated group G with the word length metric this homology theory turns out to be related to amenability of G. We characterize vanishing of a certain…

This work concerns the problem of relating characteristic numbers of one-dimensional holomorphic foliations of P^n to those of algebraic varieties invariant by them. More precisely: if M is a connected complex manifold, a one-dimensional…

We consider Directed Steiner Forest (DSF), a fundamental problem in network design. The input to DSF is a directed edge-weighted graph $G = (V, E)$ and a collection of vertex pairs $\{(s_i, t_i)\}_{i \in [k]}$. The goal is to find a minimum…

We discuss universal properties of conformal field theories with holographic duals. A central feature of these theories is the existence of a low-lying sector of operators whose correlators factorize. We demonstrate that factorization can…

We show that holography poses non-trivial restrictions on various couplings of an interacting field. For a vector boson in the AdS Reissner-Nordstrom background, the dual boundary theory is pathological unless its electromagnetic and…