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

Many high-dimensional and large-volume data sets of practical relevance have hierarchical structures induced by trees, graphs or time series. Such data sets are hard to process in Euclidean spaces and one often seeks low-dimensional…

Trigraph list homomorphism problems (also known as list matrix partition problems) have generated recent interest, partly because there are concrete problems that are not known to be polynomial time solvable or NP-complete. Thus while…

The Steiner tree problem can be stated in terms of finding a connected set of minimal length containing a given set of finitely many points. We show how to formulate it as a mass-minimization problem for $1$-dimensional currents with…

We study the hyperbolic random geometric graph introduced in Krioukov et al. For a sequence $R_n \to \infty$, we define these graphs to have the vertex set as Poisson points distributed uniformly in balls $B(0,R_n) \subset B_d^{\alpha}$,…

We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…

Modular invariance strongly constrains the spectrum of states of two dimensional conformal field theories. By summing over the images of the modular group, we construct candidate CFT partition functions that are modular invariant and have…

Poincar\'e profiles are a family of analytically defined coarse invariants, which can be used as obstructions to the existence of coarse embeddings between metric spaces. In this paper we calculate the Poincar\'e profiles of all connected…

The celebrated Steiner tree problem is the problem of finding a set $St$ of minimum one-dimensional Hausdorff measure $H$ (length) such that $St \cup \mathcal{A}$ is connected, where $\mathcal{A} \subset \mathbb{R}^d$ is a given compact…

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…

Let $X$ be a Stein manifold of complex dimension $n>1$ endowed with a Riemannian metric $\mathfrak{g}$. We show that for every integer $k$ with $\left[\frac{n}{2}\right] \le k \le n-1$ there is a nonsingular holomorphic foliation of…

A set of vertices $W$ in a connected graph $G$ is called a Steiner dominating set if $W$ is both Steiner and dominating set. The Steiner domination number $\gamma_{st}(G)$ is the minimum cardinality of a Steiner dominating set of $G$. A…

In the paper we study the structure of hyperplanes of so called binomial partial Steiner triple systems (BSTS's, in short) i.e. of configurations with $\binom{n}{2}$ points and $\binom{n}{3}$ lines, each line of the size $3$. Consequently,…

Graphs and recently hypergraphs have been known as an important tool for considering different properties of quantum many-body systems. In this paper, we study a mapping between an important class of quantum systems namely quantum…

In this paper we study a natural generalization of both {\sc $k$-Path} and {\sc $k$-Tree} problems, namely, the {\sc Subgraph Isomorphism} problem. In the {\sc Subgraph Isomorphism} problem we are given two graphs $F$ and $G$ on $k$ and $n$…

In this paper we propose and study a new complexity model for approximation algorithms. The main motivation are practical problems over large data sets that need to be solved many times for different scenarios, e.g., many multicast trees…

Central to the AdS/CFT correspondence is a precise relationship between the curvature of an anti-de Sitter (AdS) spacetime and the central charge of the dual conformal field theory (CFT) on its boundary. Our work shows that such a…

In this paper, we study two types of strong subgraph packing problems in digraphs, including internally disjoint strong subgraph packing problem and arc-disjoint strong subgraph packing problem. These problems can be viewed as…

The hop-constrained Steiner tree problem (HSTP) is a generalization of the classical Steiner tree problem. It asks for a minimum cost subtree that spans some specified nodes of a given graph, such that the number of edges between each node…

Conformal blocks are the fundamental, theory-independent building blocks in any CFT, so it is important to understand their holographic representation in the context of AdS/CFT. We describe how to systematically extract the holographic…

Embedding tree-like data, from hierarchies to ontologies and taxonomies, forms a well-studied problem for representing knowledge across many domains. Hyperbolic geometry provides a natural solution for embedding trees, with vastly superior…