Two infinite families of facets of the holographic entropy cone

Abstract

We verify that the recently proven infinite families of holographic entropy inequalities are maximally tight, i.e. they are facets of the holographic entropy cone. The proof is technical but it offers some heuristic insight. On star graphs, both families of inequalities quantify how concentrated / spread information is with respect to a dihedral symmetry acting on subsystems. In addition, toric inequalities viewed in the K-basis show an interesting interplay between four-party and six-party perfect tensors.

18 pages plus appendices, 8 figures, 18 lemmas. v4: one minor but crucial typo fixed

References in corpus (4)

• A holographic inequality for $N=7$ regions
• Holographic Entropy Inequalities and Multipartite Entanglement
• The Symmetrized Holographic Entropy Cone
• Holographic Cone of Average Entropies

Cited by in corpus (7)

• Testing holographic entropy inequalities in 2+1 dimensions
• Towards a complete classification of holographic entropy inequalities
• A framework for generalizing toric inequalities for holographic entanglement entropy
• Algorithmic construction of SSA-compatible extreme rays of the subadditivity cone and the $\mathsf{N}=6$ solution
• Purely GHZ-like entanglement is forbidden in holography
• On the completeness of contraction map proof method for holographic entropy inequalities
• Exploring the holographic entropy cone via reinforcement learning