关于（真正）多熵的图编码流形的注记
Notes on the Graph-Encoded Manifolds for the (Genuine) Multi-Entropy
浏览论文内容
中文总结 AI 辅助
本文针对𝚞=4的情况，研究图编码流形（GEM）条件，分类了Γ_{4,n}的顶点链拓扑，得出其亏格公式，明确了GEM条件成立的n取值及奇点情况。
中文摘要 AI 辅助
真正多熵是𝚞部分多熵的一部分，它捕获所有𝚞个 parties 之间真正共享的纠缠，而非更少子系统间已存在的纠缠。近期研究表明，可通过从基础𝚞部分多熵置换族构建的图编码流形（GEM）来研究这一真正部分——即所谓的多体纠缠信号：将其𝚞色收缩图Γ_{𝚞,n}视为由(𝚞−1)单形构成的三角剖分。聚焦于𝚞=4，我们对Γ_{4,n}的每个顶点链拓扑进行分类，得出χ_{link}(n)=n(3−n)：当且仅当n=2时，该图满足GEM条件（即每个顶点链为二维球面）；而对于所有n≥3，顶点链为严格正亏格g_n=½(n−1)(n−2)的闭曲面，因此该图定义了一个在每个顶点处具有锥形奇点的单纯复形。
英文摘要
Genuine multi-entropy is the part of the $\mathtt{q}$-partite multi-entropy that captures entanglement genuinely shared among all $\mathtt{q}$ parties, rather than entanglement already present among fewer subsystems. It was recently proposed that this genuine part -- so-called a multipartite entanglement signal -- can be studied via the graph-encoded manifold (GEM) built from the underlying $\mathtt{q}$-partite multi-entropy permutation family: reading its $\mathtt{q}$-colored contraction graph $Γ_{\mathtt{q},n}$ as a triangulation by $(\mathtt{q}-1)$-simplices. Focusing on $\mathtt{q}=4$, we classify the topology of every vertex link of $Γ_{4,n}$ and find $χ_{\rm link}(n)=n(3-n)$: the graph satisfies the GEM condition, namely every vertex link is a two-sphere, if and only if $n=2$, while for every $n\geq3$ the vertex links are closed surfaces of strictly positive genus $g_n=\tfrac12(n-1)(n-2)$, so that the graph instead defines a simplicial complex with a conical singularity at every vertex.
