Riemannian and Lorentzian flow-cut theorems
Add this Pith Number to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{P2KVWHLB}
Prints a linked pith:P2KVWHLB badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
We prove several geometric theorems using tools from the theory of convex optimization. In the Riemannian setting, we prove the max flow-min cut theorem for boundary regions, applied recently to develop a "bit-thread" interpretation of holographic entanglement entropies. We also prove various properties of the max flow and min cut, including respective nesting properties. In the Lorentzian setting, we prove the analogous min flow-max cut theorem, which states that the volume of a maximal slice equals the flux of a minimal flow, where a flow is defined as a divergenceless timelike vector field with norm at least 1. This theorem includes as a special case a continuum version of Dilworth's theorem from the theory of partially ordered sets. We include a brief review of the necessary tools from the theory of convex optimization, in particular Lagrangian duality and convex relaxation.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
Exploring the holographic entropy cone via reinforcement learning
Reinforcement learning finds explicit graph realizations for three of six previously unresolved extreme rays of the N=6 holographic entropy cone and supplies evidence that the other three lie outside it.
-
Holographic Tensor Networks as Tessellations of Geometry
Holographic tensor networks constructed from PEE-thread tessellations of AdS geometry reproduce the exact Ryu-Takayanagi formula in factorized EPR, perfect-tensor, and random variants.
-
Quantum Bit Threads and the Entropohedron
Derives several new quantum bit thread prescriptions equivalent to quantum extremal surfaces for static holographic states and introduces entanglement distribution functions organized into the entropohedron convex polytope.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.