Related papers: Perturbative classical conformal blocks as Steiner…
We extend the work of [4] to support the conjecture that any conformal field theory with a large N expansion and a large gap in the spectrum of anomalous dimensions has a local bulk dual. We count to O(1/N^2) the solutions to the crossing…
In this summary of my talk at Strings 2016, I explain how classical dynamics on an infinite tree graph can be dual to a conformal field theory defined over the $p$-adic numbers. An informal introduction to $p$-adic numbers is followed by a…
Let T be a tree with an action of a finitely generated group G. Given a suitable equivalence relation on the set of edge stabilizers of T (such as commensurability, co-elementarity in a relatively hyperbolic group, or commutation in a…
A well-known open problem on the behavior of optimal paths in random graphs in the strong disorder regime, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade [31,32,38,70] is as…
For an effective AdS theory, we present a simple prescription to compute the renormalization of its dual boundary field theory. In particular, we define anomalous dimension holographically as the dependence of the wave-function…
Discrete geometries in hyperbolic space are of longstanding interest in pure mathematics and have come to recent attention in holography, quantum information, and condensed matter physics. Working at a purely geometric level, we describe…
Network design problems aim to compute low-cost structures such as routes, trees and subgraphs. Often, it is natural and desirable to require that these structures have small hop length or hop diameter. Unfortunately, optimization problems…
In frames of dS/CFT correspondence suggested by Strominger we calculate holographic conformal anomaly for dual euclidean CFT. The holographic renormalization group method is used for this purpose. It is explicitly demonstrated that…
We study the parameterized complexity of the directed variant of the classical {\sc Steiner Tree} problem on various classes of directed sparse graphs. While the parameterized complexity of {\sc Steiner Tree} parameterized by the number of…
Dirac's theorem determines the sharp minimum degree threshold for graphs to contain perfect matchings and Hamiltonian cycles. There have been various attempts to generalize this theorem to hypergraphs with larger uniformity by considering…
We introduce the Non-commutative Subset Convolution - a convolution of functions useful when working with determinant-based algorithms. In order to compute it efficiently, we take advantage of Clifford algebras, a generalization of…
The Steiner Forest problem is an important generalization of the Steiner Tree problem. We are given an undirected graph with nonnegative edge costs and a collection of pairs of vertices. The task is to compute a cheapest forest with the…
In this paper, we give a constructive proof of the fact that the treewidth of a graph is at most its divisorial gonality. The proof gives a polynomial time algorithm to construct a tree decomposition of width at most $k$, when an effective…
The field identification problem, including fixed point resolution, is solved for the non-hermitian symmetric $N=2$ superconformal coset theories. Thereby these models are finally identified as well-defined modular invariant CFTs. As an…
Given a simple connected undirected graph G = (V, E), a set X \subseteq V(G), and integers k and p, STEINER SUBGRAPH EXTENSION problem asks if there exists a set S \supseteq X with at most k vertices such that G[S] is p-edge-connected. This…
We initiate the study of degree-bounded network design problems in the online setting. The degree-bounded Steiner tree problem { which asks for a subgraph with minimum degree that connects a given set of vertices { is perhaps one of the…
We give approximation schemes for Subset TSP and Steiner Tree on unit disk graphs, and more generally, on intersection graphs of similarly sized connected fat (not necessarily convex) polygons in the plane. As a first step towards this…
Steiner Tree Problem (STP) in graphs aims to find a tree of minimum weight in the graph that connects a given set of vertices. It is a classic NP-hard combinatorial optimization problem and has many real-world applications (e.g., VLSI chip…
We examine the correspondence between the conformal field theory of boundary operators and two-dimensional hyperbolic geometry. By consideration of domain boundaries in two-dimensional critical systems, and the invariance of the hyperbolic…
It has long been clear that the conformal bootstrap is associated with a rich geometry. In this paper we undertake a systematic exploration of this geometric structure as an object of study in its own right. We study conformal blocks for…