相关论文: Perturbative classical conformal blocks as Steiner…
We define a holographic dual to the Donaldson-Witten topological twist of $\mathcal{N}=2$ gauge theories on a Riemannian four-manifold. This is described by a class of asymptotically locally hyperbolic solutions to $\mathcal{N}=4$ gauged…
In this paper, we consider the Uniform Cost-Distance Steiner Tree Problem in metric spaces, a generalization of the well-known Steiner tree problem. Cost-distance Steiner trees minimize the sum of the total length and the weighted path…
Generally, quantum field theories can be thought as deformations away from conformal field theories. In this article, with a simple bottom up model assumed to possess a holographic description, we study a putative large N quantum field…
Associated to any finite metric space are a large number of objects and quantities which provide some degree of structural or geometric information about the space. In this paper we show that in the setting of subsets of weighted Hamming…
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 study a family of higher-derivative conformal operators $P_{2k}^{(2)}$ acting on transverse-traceless symmetric 2-tensors on generic Einstein spaces. They are a natural generalization of the well-known construction for scalars. We first…
We study the correspondence between four-dimensional supersymmetric gauge theories and two-dimensional conformal field theories in the case of N=2* gauge theory. We emphasize the genus expansion on the gauge theory side, as obtained via…
Uniform cost-distance Steiner trees minimize the sum of the total length and weighted path lengths from a dedicated root to the other terminals. They are applied when the tree is intended for signal transmission, e.g. in chip design or…
The $S$-Steiner tree packing problem provides mathematical foundations for optimizing multi-path information transmission, particularly in designing fault-tolerant parallelized routing architectures for massive-scale network…
Steiner Tree Packing (STP) is a notoriously hard problem in classical complexity theory, which is of practical relevance to VLSI circuit design. Previous research has approached this problem by providing heuristic or approximate algorithms.…
Tree representations of (sets of) symmetric binary relations, or equivalently edge-colored undirected graphs, are of central interest, e.g.\ in phylogenomics. In this context symbolic ultrametrics play a crucial role. Symbolic ultrametrics…
Group theoretic and graphical techniques are used to derive the N-body wave function for a system of identical bosons with general interactions through first-order in a perturbation approach. This method is based on the maximal symmetry…
Given a set of points, we define a minimum Steiner point tree to be a tree interconnecting these points and possibly some additional points such that the length of every edge is at most 1 and the number of additional points is minimized. We…
We give an approximation scheme for the TSP in $d$-dimensional hyperbolic space that has optimal dependence on $\varepsilon$ under Gap-ETH. For any fixed dimension $d\geq 2$ and for any $\varepsilon>0$ our randomized algorithm gives a…
The Spanning Tree Congestion (STC) problem is the following NP-hard problem: given a graph $G$, construct a spanning tree $T$ of $G$ minimizing its maximum edge congestion where the congestion of an edge $e\in T$ is the number of edges $uv$…
Decision trees are popular machine learning models that are simple to build and easy to interpret. Even though algorithms to learn decision trees date back to almost 50 years, key properties affecting their generalization error are still…
The monster sporadic group is the automorphism group of a central charge $c=24$ vertex operator algebra (VOA) or meromorphic conformal field theory (CFT). In addition to its $c=24$ stress tensor $T(z)$, this theory contains many other…
A hypertree, or $\mathbb{Q}$-acyclic complex, is a higher-dimensional analogue of a tree. We study random $2$-dimensional hypertrees according to the determinantal measure suggested by Lyons. We are especially interested in their…
The Euclidean Steiner tree problem seeks the min-cost network to connect a collection of target locations, and it underlies many applications of wireless networks. In this paper, we present a study on solving the Euclidean Steiner tree…
Recent studies of holographic tensor network models defined on regular tessellations of hyperbolic space have not yet addressed the underlying discrete geometry of the boundary. We show that the boundary degrees of freedom naturally live on…