Integral Geometry and Holography

We present a mathematical framework which underlies the connection between information theory and the bulk spacetime in the AdS$_3$/CFT$_2$ correspondence. A key concept is kinematic space: an auxiliary Lorentzian geometry whose metric is defined in terms of conditional mutual informations and which organizes the entanglement pattern of a CFT state. When the field theory has a holographic dual obeying the Ryu-Takayanagi proposal, kinematic space has a direct geometric meaning: it is the space of bulk geodesics studied in integral geometry. Lengths of bulk curves are computed by kinematic volumes, giving a precise entropic interpretation of the length of any bulk curve. We explain how basic geometric concepts -- points, distances and angles -- are reflected in kinematic space, allowing one to reconstruct a large class of spatial bulk geometries from boundary entanglement entropies. In this way, kinematic space translates between information theoretic and geometric descriptions of a CFT state. As an example, we discuss in detail the static slice of AdS$_3$ whose kinematic space is two-dimensional de Sitter space.Comment: 23 pages + appendices, including 23 figures and an exercise sheet with solutions; a Mathematica visualization too

Parametric Polyhedra with at least kk Lattice Points: Their Semigroup Structure and the k-Frobenius Problem

Given an integral $d \times n$ matrix $A$, the well-studied affine semigroup \mbox{ Sg} (A)=\{ b : Ax=b, \ x \in {\mathbb Z}^n, x \geq 0\} can be stratified by the number of lattice points inside the parametric polyhedra $P_A(b)=\{x: Ax=b, x\geq0\}$. Such families of parametric polyhedra appear in many areas of combinatorics, convex geometry, algebra and number theory. The key themes of this paper are: (1) A structure theory that characterizes precisely the subset \mbox{ Sg}_{\geq k}(A) of all vectors b \in \mbox{ Sg}(A) such that $P_A(b) \cap {\mathbb Z}^n$ has at least $k$ solutions. We demonstrate that this set is finitely generated, it is a union of translated copies of a semigroup which can be computed explicitly via Hilbert bases computations. Related results can be derived for those right-hand-side vectors $b$ for which $P_A(b) \cap {\mathbb Z}^n$ has exactly $k$ solutions or fewer than $k$ solutions. (2) A computational complexity theory. We show that, when $n$, $k$ are fixed natural numbers, one can compute in polynomial time an encoding of \mbox{ Sg}_{\geq k}(A) as a multivariate generating function, using a short sum of rational functions. As a consequence, one can identify all right-hand-side vectors of bounded norm that have at least $k$ solutions. (3) Applications and computation for the $k$-Frobenius numbers. Using Generating functions we prove that for fixed $n,k$ the $k$-Frobenius number can be computed in polynomial time. This generalizes a well-known result for $k=1$ by R. Kannan. Using some adaptation of dynamic programming we show some practical computations of $k$-Frobenius numbers and their relatives

A measure of non-convexity in the plane and the Minkowski sum

In this paper a measure of non-convexity for a simple polygonal region in the plane is introduced. It is proved that for "not far from convex" regions this measure does not decrease under the Minkowski sum operation, and guarantees that the Minkowski sum has no "holes".Comment: 5 figures; Discrete and Computational Geometry, 201