巨置换群的快速检测
Fast detection of giant permutation groups
摘要:
本文给出了一个单侧随机化算法来检测由生成元给出的n次置换群是否包含n次交错群。这改进了标准的方法,并对P.Cameron和J.Cannon的算法。
英文摘要:
We give a 1-sided randomised algorithm to detect when a permutation group of degree n, given by generators, contains the alternating group of degree n. This improves on standard methods, and on an algorithm of P. Cameron and J. Cannon.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。