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.
Title resolution pending
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 4years
2026 4verdicts
UNVERDICTED 4roles
background 1polarities
background 1representative citing papers
Multipartite entanglement quantities in holographic Weyl semimetals develop features at the topological critical point and distinguish phases through anisotropic large-l scaling.
In time-reflection-symmetric holographic states, I3 implies vanishing of multiple four-party entanglement measures and bounds those from multi-entropy, though Q4 is not quantitatively bounded by I3.
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.
-
Detecting Topological Transitions and Anisotropy through Multipartite Entanglement in Holographic Weyl Semimetals
Multipartite entanglement quantities in holographic Weyl semimetals develop features at the topological critical point and distinguish phases through anisotropic large-l scaling.
-
Constraints on four-party entanglement in holography
In time-reflection-symmetric holographic states, I3 implies vanishing of multiple four-party entanglement measures and bounds those from multi-entropy, though Q4 is not quantitatively bounded by I3.
-
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.