arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.12344math.QAmath.COmath.OA
收藏

量子 Sabidussi 定理

Quantum Sabidussi's Theorem

Arnbjörg Soffía Árnadóttir, Josse van Dobben de Bruyn, Prem Nigam Kar, David E. Roberson, Peter Zeman

AI总结:

本文证明有限图字典积的量子 Sabidussi 定理,以量子自同构群和自由圈积刻画结构,并推广至量子顶点传递图。

摘要:

Sabidussi 定理(发表于《Duke Math. J.》第28卷,1961年)给出了两个图的字典积的自同构群等于各自自同构群的圈积的充要条件。我们针对有限图证明了 Sabidussi 定理的量子版本,其中自同构群被替换为量子自同构群,圈积被替换为量子群的自由圈积。这推广了 Chassaniol(发表于《J. Algebra》第456卷,2016年)的结果,后者仅对正则图证明了该结论。此外,我们将结果应用于量子顶点传递图的字典积,即使在 Sabidussi 条件不成立时也能确定其量子自同构群。

英文摘要:

Sabidussi's theorem [Duke Math. J. 28, 1961] gives necessary and sufficient conditions under which the automorphism group of a lexicographic product of two graphs is a wreath product of the respective automorphism groups. We prove a quantum version of Sabidussi's theorem for finite graphs, with the automorphism groups replaced by quantum automorphism groups and the wreath product replaced by the free wreath product of quantum groups. This extends the result of Chassaniol [J. Algebra 456, 2016], who proved it for regular graphs. Moreover, we apply our result to lexicographic products of quantum vertex transitive graphs, determining their quantum automorphism groups even when Sabidussi's conditions do not apply.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑