For n=2, Rényi multi-entropies in RTNs are determined by minimal multiway cuts; the minimal multiway cut conjecture fails for integer n>2 with explicit counterexamples.
Why many- partite entanglement is essential for holography
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
hep-th 4roles
background 1polarities
background 1representative citing papers
Authors derive genuine multientropy for Lifshitz states as mutual information plus negativity, obtain its non-integer Rényi continuation, and prove dihedral invariants equal Rényi reflected entropies for general tripartite pure states.
The entanglement wedge polygon volume is proposed as a holographic probe of multipartite entanglement; in AdS3 it is topologically quantized, and a mixed-state generalization is constructed.
The junction law for multipartite entanglement persists in confining holographic backgrounds, but phase structure and GM short-distance scaling (L^{-4}, L^{-2}, or L^{-2}(log L)^2) are background-dependent.
citing papers explorer
-
Multi-entropy in random tensor networks
For n=2, Rényi multi-entropies in RTNs are determined by minimal multiway cuts; the minimal multiway cut conjecture fails for integer n>2 with explicit counterexamples.
-
Genuine multientropy, dihedral invariants and Lifshitz theory
Authors derive genuine multientropy for Lifshitz states as mutual information plus negativity, obtain its non-integer Rényi continuation, and prove dihedral invariants equal Rényi reflected entropies for general tripartite pure states.
-
The Entanglement Wedge Polygon
The entanglement wedge polygon volume is proposed as a holographic probe of multipartite entanglement; in AdS3 it is topologically quantized, and a mixed-state generalization is constructed.
-
The Junction Law for Multipartite Entanglement in Confining Holographic Backgrounds
The junction law for multipartite entanglement persists in confining holographic backgrounds, but phase structure and GM short-distance scaling (L^{-4}, L^{-2}, or L^{-2}(log L)^2) are background-dependent.