Schurian反对称相干组态的基与Schurian竞赛图的同构检验
Bases of schurian antisymmetric coherent configurations and isomorphism test for schurian tournaments
摘要:
已知对于任何奇数阶置换群$G$,可以找到置换集的子集,其在$G$中的稳定子是平凡的,并且如果$G$是本原的,则还可以找到大小至多为3的基。这两个结果都推广到了$G$的相干位形(在这种情况下是一个Schurian反对称相干位形)。这使得我们能够构造一个多项式时间算法来识别和同构测试的schurian竞赛(即弧着色竞赛的连贯配置是schurian)。
英文摘要:
It is known that for any permutation group $G$ of odd order one can find a subset of the permuted set whose stabilizer in $G$ is trivial, and if $G$ is primitive, then also a base of size at most 3. Both of these results are generalized to the coherent configuration of $G$ (that is in this case a schurian antisymmetric coherent configuration). This enables us to construct a polynomial-time algorithm for recognizing and isomorphism testing of schurian tournaments (i.e. arc colored tournaments the coherent configurations of which are schurian).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。