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.
Reflected entropy in random tensor networks. Part III. Triway cuts
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
hep-th 3years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Twirled perfect tensor networks achieve computational covariance, bound complexity by the PLC, and obey a lattice Ryu-Takayanagi formula for arbitrary boundary subregions.
Multi-entropy exhibits a structural obstruction to replica symmetry breaking in random tensor networks due to incompatible boundary permutations in the replica hypercube, unlike entanglement negativity.
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.
-
Twirled Perfect Tensor Networks: Computationally covariant holographic tensor networks
Twirled perfect tensor networks achieve computational covariance, bound complexity by the PLC, and obey a lattice Ryu-Takayanagi formula for arbitrary boundary subregions.
-
Structural Obstruction to Replica Symmetry Breaking for Multi-Entropy in Random Tensor Networks
Multi-entropy exhibits a structural obstruction to replica symmetry breaking in random tensor networks due to incompatible boundary permutations in the replica hypercube, unlike entanglement negativity.